Versatile boxes: a multi-purpose algebra of high-level Petri nets

Authors:
Franck Pommereau
Affiliations:
LACL, Université Paris
Venue:
Proceedings of the 2007 Summer Computer Simulation Conference
Year:
2007

Citing 5
Cited 2

Petri net algebra

Petri net algebra
A class of composable and preemptible high-level Petri nets with an application to multi-tasking systems

Fundamenta Informaticae
High Level Expressions with their SOS Semantics (Extended Abstract)

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
The box calculus: a new causal algebra with multi-label communication

Advances in Petri Nets 1992, The DEMON Project
Asynchronous box calculus

Fundamenta Informaticae

Quickly prototyping petri nets tools with SNAKES

Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops
Towards Efficient Verification of Systems with Dynamic Process Creation

Proceedings of the 5th international colloquium on Theoretical Aspects of Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a model of composable Petri nets, called Versatile Boxes, that has all the high-level features already introduced in the family of the Petri Box Calculus (mainly: data and time representation) as well as a new interruption capability. This allows for defining processes that are able to interrupt their execution at any point, just as a program can raise an exception. By choosing a carefully tuned level of generality, we are able to obtain a model that is much simpler than previous approaches, while still allowing to give the semantics of the usual programming language constructs. We believe that our model has the required characteristics for a very general use, hence its name. On the other hand, its is not very complex and so it should be easy to understand or implement and efficient for verification or simulation purpose.