OB(PN)2: an object based petri net programming notation
Concurrent object-oriented programming and petri nets
Weak and Strong Composition of High-Level Petri-Nets
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
A Compositional Petri Net Semantics for SDL
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
A Concurrent and Compositional Petri Net Semantics of Preemption
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
General parameterised refinement and recursion for the M-net calculus
Theoretical Computer Science
Synchronous and Asynchronous Communications in Composable Parameterized High-Level Petri Nets
Fundamenta Informaticae
Branching processes of high-level Petri nets
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Compositional semantics for UML 2.0 sequence diagrams using petri nets
SDL'05 Proceedings of the 12th international conference on Model Driven
Synchronous and Asynchronous Communications in Composable Parameterized High-Level Petri Nets
Fundamenta Informaticae
Generalised Composition Operations for High-level Petri Nets
Fundamenta Informaticae
| Hi-index | 0.00 |
Verification of parallel programs is a very important goal on the way to improve the reliability of software. The PEP tool, a Programming Environment based on Petri nets, allows verification of parallel programs by a variety of different verification methods (e.g., partial order or BDD based model checking, and stubborn set or symmetrically reduced state space analysis) based on a compositional denotational Petri net semantics. The main contribution of this paper consists in the development of a fully compositional high-level Petri net semantics for concurrent programs with procedures, covering recursion, global variables, and different types of parameter passing (including call-by-reference). The semantics (which is already implemented) is oriented towards verification, i.e., the semantic models are minimized. Due to the abstract and flexible nature of the Petri net model used, our approach is very general and may also be applied to other specification and programming languages. We are, for instance, presently approaching SDL (Specification and Description Language).