Concurrent and maximally concurrent evolution of nonsequential systems
Theoretical Computer Science
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
Nonsequential processes
Branching processes of Petri nets
Acta Informatica
Selected papers of the Second Workshop on Concurrency and compositionality
Information and Computation
Process semantics for place/transition nets with inhibitor and read arcs
Fundamenta Informaticae - Special issue prepared in tribute to Peter Ernst on the occasion of his retirement
Journal of Computer and System Sciences
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Analysis issues in Petri nets with inhibitor arcs
Theoretical Computer Science
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Partial order semantics and read arcs
Theoretical Computer Science
Theoretical Computer Science - Natural computing
Place or Transition Petri Nets
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Proceedings of the 13th International Conference on Application and Theory of Petri Nets
Logic of Programs and Their Applications, Proceedings
Limitations of Dijkstra's Semaphore Primitives and Petri nets
SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
PETRI NET LANGUAGE
Process semantics of general inhibitor nets
Information and Computation
Hazard Detection in a GALS Wrapper: A Case Study
ACSD '05 Proceedings of the Fifth International Conference on Application of Concurrency to System Design
Processes of Petri Nets with Range Testing
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Unfoldings: A Partial-Order Approach to Model Checking (Monographs in Theoretical Computer Science. An EATCS Series)
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
A Petri net model for membrane systems with dynamic structure
Natural Computing: an international journal
The Oxford Handbook of Membrane Computing
The Oxford Handbook of Membrane Computing
Journal of Computer and System Sciences
Process semantics for membrane systems
Journal of Automata, Languages and Combinatorics
Synchrony and asynchrony in membrane systems
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Towards a petri net semantics for membrane systems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Infinite process semantics of inhibitor nets
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Applying step coverability trees to communicating component-based systems
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Step coverability algorithms for communicating systems
Science of Computer Programming
Hi-index | 0.00 |
In this survey paper, we discuss how to enhance the modelling power of Place/Transition-nets with the notions of ‘locality’ of individual transitions and token ‘testing’ using inhibitor and activator arcs (or, more generally, range arcs). As motivation for these extensions we consider membrane systems – a computational model inspired by the way chemical reactions take place in cells that are divided by membranes into compartments. We explain how key features of membrane systems can be in a natural way captured by transitions with localities (to model compartments) and range arcs (to model inhibitors and promoters). For the resulting model of PTRL-nets, we discuss the synchrony and asynchrony in their behaviours and outline how their causal processes can be defined. Both localities and range arcs render problems, such as boundedness, undecidable in the general case. We therefore present conditions under which one can still decide whether a net is bounded.