Synchronized elementary net systems

The behaviour of distributed systems with temporal constraints can be analyzed by means of Time Petri Nets. We show that this approach leads to a sequential observation of the system. Generally, each subsystem is synchronous: its evolutions are controlled by a "synchronizing" event. The communications between subsystems are asynchronous. To tackle the modelling problem raised by these systems, we introduce a low level model that integrates synchronization constraints. This model is called "Synchronized Elementary net System". It consists of an underlying elementary net system and a constraint structure. Extending the notion of process, we explain how to obtain non-sequential observations of these systems.

[1]  Eike Best,et al.  Concurrent Behaviour: Sequences, Processes and Axioms , 1984, Seminar on Concurrency.

[2]  Wolfgang Reisig,et al.  A strong part of concurrency , 1986, European Workshop on Applications and Theory of Petri Nets.

[3]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[4]  J. Grabowski,et al.  On partial languages , 1981, Fundam. Informaticae.

[5]  Bernard Berthomieu,et al.  An Enumerative Approach for Analyzing Time Petri Nets , 1983, IFIP Congress.

[6]  Ilaria Castellani,et al.  On the Semantics of Concurrency: Partial Orders and Transition Systems , 1987, TAPSOFT, Vol.1.

[7]  Gérard Berry,et al.  The ESTEREL Synchronous Programming Language and its Mathematical Semantics , 1984, Seminar on Concurrency.