Selected papers of the Second Workshop on Concurrency and compositionality
The synthesis problem of Petri nets
Acta Informatica
The synthesis problem for elementary net systems is NP-complete
Theoretical Computer Science
The synthesis problem for elementary net systems with inhibitor arcs
Fundamenta Informaticae - Special issue prepared in tribute to Peter Ernst on the occasion of his retirement
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
Processes of membrane systems with promoters and inhibitors
Theoretical Computer Science
Synthesis of Elementary Net Systems with Context Arcs and Localities
Fundamenta Informaticae - PETRI NETS 2007
Synthesis of Nets with Step Firing Policies
Fundamenta Informaticae - Petri Nets 2008
Moving from Weakly Endochronous Systems to Delay-Insensitive Circuits
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a petri net semantics for membrane systems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Transition systems of elementary net systems with localities
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Hi-index | 0.00 |
There is a growing need to introduce and develop computational models capable of faithfully modelling systems whose behaviour combines synchrony with asynchrony in a variety of complicated ways. Examples of such real-life systems can be found from VLSI hardware to systems of cells within which biochemical reactions happen in synchronised pulses. One way of capturing the resulting intricate behaviours is to use Petri nets with localities partitioning transitions into disjoint groups within which execution is synchronous and maximally concurrent. In this paper, we generalise this type of nets by allowing each transition to belong to several localities. Moreover, we define this extension in a generic way for all classes of nets defined by net-types. The semantics of nets with overlapping localities can be defined in different ways, and we here discuss four fundamental interpretations, each of which turns out to be an instance of the general model of nets with policies. Thanks to this fact, it is possible to automatically synthesise nets with localities from behavioural specifications given in terms of finite transition systems. We end the paper outlining some initial ideas concerning net synthesis when the association of transitions to localities is not given and has to be determined by the synthesis algorithm.