Abstract
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.
This is a revision of the paper "Synchronized Condition/Event Systems", presented at the 9th European Workshop on Application and Theory of Petri nets, Venice (Italy), June 1988.
Preview
Unable to display preview. Download preview PDF.
VII. References
Advanced Course on Petri nets: Application and Relationships to Other Models of Concurrency. LNCS 255, Springer-Verlag 87.
C.ANDRE: A semantics of timed Petri nets in terms of low level Petri nets. 7th European Workshop on Petri Nets, OXFORD (UK), 86, 115–130.
C.ANDRE: Etude du comportement d'un système synchronisé. Rapport Technique RR87-3, LASSY, Déc 1987
C.ANDRE: Computing Delays in extended processes. Technical Report RR88-2, LASSY, May 1988
G.BERRY, L.COSSERAT: The Synchronous Programming Language ESTEREL and its Mathematical Semantics. Seminar on Concurrency, Springer-Verlag, LNCS 197, 1985.
E.BEST, C.FERNANDEZ: Notation and Terminology of Petri Net Theory. Arbeitspapiere der GMD, 195, Jan 1986.
E. BEST: Concurrent behaviour: Sequences, processes and axioms. Seminar on Concurrency, LNCS 197, 1985, 221–245
G. BOUDOL, I. CASTELLANI: On the Semantics of Concurrency: Partial Orders and Transition Systems. Proc Coll on Trees in Algebra in Programming (CAAP), PISA, Italy, 1987.
J. GRABOWSKI: On Partial Languages. Fumdamentæ Informaticæ IV.2 (1981) 427–498.
A.KIEHN: Infinitary Partial Petri Net Languages and their Relationship to other Petri Net Semantics. 8th European Workshop on Petri Nets, ZARAGOZA, Spain, June 87, 429–450.
M.MENASCHE, B.BERTHOMIEU: An Enumerative Approach for Analyzing Time Petri Nets. IFIP 83, PARIS, Sept 83.
M.MENASCHE: Analyse des Réseaux de Petri Temporisés et Application aux Systèmes Distribués. Thèse de Docteur Ingénieur, TOULOUSE, Nov 82.
MERLIN: On the Relation between Timings and Structure of Recoverable Processes. IBM Research Rep RC5551 (24094) 7/31/75.
NIELSEN, PLOTKIN, WINSKEL: Petri Nets, Event Structures and Domains. TCS 134 (1981), 85–108.
W.REISIG: On the Semantics of Petri Nets. in Formal Models in Programming (E.J Neuhold, G.Chroust, Eds), North-Holland (1985) 345–372.
W.REISIG: A strong part of concurrency. Advances in Petri Nets 1987, Lecture Note in Computer Science 266, Springer-Verlag, 238–272.
G.ROZENBERG: Behaviour of Elementary Net Systems. in [ACPN86] Part I, 60–94.
P.S.THIAGARAJAN: Elementary Net Systems. in [ACPN86] Part I, 26–59.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andre, C. (1990). Synchronized elementary net systems. In: Rozenberg, G. (eds) Advances in Petri Nets 1989. APN 1988. Lecture Notes in Computer Science, vol 424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52494-0_25
Download citation
DOI: https://doi.org/10.1007/3-540-52494-0_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52494-6
Online ISBN: 978-3-540-46998-8
eBook Packages: Springer Book Archive