Asynchronous Links in the PBC and M-Nets

Authors:
Hanna Klaudel;Franck Pommereau
Affiliations:
-;-
Venue:
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Year:
1999

Citing 9
Cited 9

Causality, time, and deadlines

Data & Knowledge Engineering
B(PN)2 - a Basic Petri Net Programming Notation

PARLE '93 Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe
General Refinement and Recursion Operators for the Petri Box Calculus

STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Operational Semantics for the Petri Box Calculus

CONCUR '94 Proceedings of the Concurrency Theory
General Refinement for High Level Petri Nets

Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
A Memory Module Specification Using Composable High-Level Petri Nets

Formal Systems Specification, The RPC-Memory Specification Case Study (the book grow out of a Dagstuhl Seminar, September 1994)
M-net Calculus Based Semantics for Triggers

ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
The box calculus: a new causal algebra with multi-label communication

Advances in Petri Nets 1992, The DEMON Project
Counting Interfaces for Discrete Time Modeling

Counting Interfaces for Discrete Time Modeling

An Algebra of Non-safe Petri Boxes

AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
A Concurrent Semantics of Static Exceptions in a Parallel Programming Language

ICATPN '01 Proceedings of the 22nd 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
Modeling multi-valued genetic regulatory networks using high-level petri nets

ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Petri Net Semantics of the Finite π-calculus Terms

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

Fundamenta Informaticae
Asynchronous Box Calculus

Fundamenta Informaticae
A Class of Composable and Preemptible High-level Petri Nets with an Application to Multi-Tasking Systems

Fundamenta Informaticae
Algebraical Characterisation of Interval-Timed Petri Nets with Discrete Delays

Fundamenta Informaticae - Concurrency Specification and Programming CS&P

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper aims at introducing an extension of M-nets, a fully compositional class of high-level Petri nets, and of its low-level counter part, Petri Boxes Calculus (PBC). We introduce a new operator with nice algebraic properties which allows to express asynchronous communications in a simple and flexible way. With this extension, asynchronous communications become at least as simple to express as (existing) synchronous ones. Finally, we show how this extension can be used in order to specify systems with timing constraints.