Petri nets: an introduction
Nonsequential processes
Petri Net systems and their closure properties
Advances in Petri nets 1989
Concurrent bisimulations in Petri nets
Acta Informatica
A survey of behaviour and equivalence preserving refinements of Petri nets
APN 90 Proceedings on Advances in Petri nets 1990
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
Elements of distributed algorithms: modeling and analysis with Petri nets
Elements of distributed algorithms: modeling and analysis with Petri nets
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Modular Construction and Partial Order Semantics of Petri Nets
Modular Construction and Partial Order Semantics of Petri Nets
Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract)
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
Modularization and Abstraction: The Keys to Practical Formal Verification
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Efficiency of Asynchronous Systems and Read Arcs in Petri Nets
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
A Simulation Preorder for Abstraction of Reactive Systems
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
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
A Compositional Partial Order Semantics for Petri Net Components
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Compositional Analysis with Place-Bordered Subnets
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Verifying the Correctness of AADL Modules Using Model Checking
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
Modular Verification of Petri Nets: The Temporal Logic Approach
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
Behaviour Preserving Refinement of Petri Nets
WG '86 Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Generic Approach to Connector Architectures Part II: Instantiation to Petri Nets and CSP
Fundamenta Informaticae
| Hi-index | 5.23 |
In this paper we model (discrete) reactive systems that may interact with each other by Petri net reactive modules (modules, for short) which are classical Petri nets together with a distinguished subset of interface places. We consider then an asynchronous composition operation of modules and, closely related to it, a decomposition operation. We show that any process (concurrent execution) of a composition of two modules can be decomposed into processes of "shifted" components for which a p-composition function exists, and vice versa. Based on this result, a compositional semantics of modules is then defined. Applications of process decomposition to replacement techniques of Petri nets and in proving correctness of Petri net structural transformations, are further discussed.