Synchronous and Asynchronous Communications in Composable Parameterized High-Level Petri Nets

Authors:
Raymond Devillers;Hanna Klaudel
Affiliations:
(Correspd.) Département d'informatique, Université Libre de Bruxelles, B-1050 Bruxelles, Belgium. rdevil@ulb.ac.be;LaMI - UMR 8042 CNRS, Université d'Evry-Val d'Essonne, Place des Terrasses, 91000 Evry, France. klaudel@lami.univ-evry.fr
Venue:
Fundamenta Informaticae
Year:
2005

Citing 12
Cited 0

An algebraic box calculus

Journal of Automata, Languages and Combinatorics
OB(PN)2: an object based petri net programming notation

Concurrent object-oriented programming and petri nets
Petri net algebra

Petri net algebra
A Calculus of Communicating Systems

A Calculus of Communicating Systems
Asynchronous Links in the PBC and M-Nets

ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
B(PN)2 - a Basic Petri Net Programming Notation

PARLE '93 Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe
PEP - More than a Petri Net Tool

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
General Refinement for High Level Petri Nets

Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
The PEP Tool

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
General parameterised refinement and recursion for the M-net calculus

Theoretical Computer Science
A Petri Net Semantics for B(PN)^2 with Procedures

PDSE '97 Proceedings of the 2nd International Workshop on Software Engineering for Parallel and Distributed Systems
A Class of Composable and Preemptible High-level Petri Nets with an Application to Multi-Tasking Systems

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the domain of parameterized composable high-level Petri nets (M-nets), we shall combine the refinement, the synchronization and the asynchronous link operations in a unified and general setup, while keeping the expected properties of those operations. In particular, the various high-level net operations are consistent through unfolding with their low-level counterparts, and the usual commutativity and idempotency properties are fulfilled at the syntactic level up to structural equivalences.