Abstract
Net Theory was introduced in the early sixties by Carl Adam Petri [1] as a form of general system theory based on the notion of concurrency. Net Theory has been widely developed during these years, becoming very popular as a framework for the analysis and specification of concurrent systems. Among the basic notions of the theory, stands the synchronic structure of a system. It characterizes dependencies between sets of its events in terms of a distance measuring their degree of synchronization. In this paper we show that a natural generalization of regions introduced by Ehrenfeucht and Rozenberg exactly corresponds to synchronic distances and that this notion of region can be used to axiomatise a class of transition systems corresponding to bounded place/transition nets without loops.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C.A. Petri. Kommunikation mit automaten. Schriften des Institutes für Instrumentelle Mathematik, Bonn, 1962.
C.A. Petri. Concepts of net theory. In Mathematical Foundations of Computer Science. Proceedings of Symposium and Summer School, pages 137–146, Bratislava, 1973. Mathematical Institute of Slovak Academy of Sciences.
A. Ehrenfeucht and G. Rozenberg. Partial (set) 2-structures. I and II. Acta Informatica, 27 (4): 315–368, 1990.
M. Nielsen, G. Rozenberg, and P.S. Thiagarajan. Elementary transition systems. Theoretical Computer Science, 96: 3–33, 1992.
E. Badouel, L. Bernardinello, and P. Darondeau. Polynomial algorithms for the synthesis of bounded nets. Technical Report PI-847, IRIS A, July 1994. To appear in Proceedings of CAAP 95.
J.Desel and A.Merceron. P/T-systems as abstractions of C/E-systems. In G. Rozenberg, editor, Advances in Petri Nets 1989, number 424 in LNCS. Springer-Verlag, 1990.
M. Mukund. Petri nets and step transition systems. International lournal of Foundations of Computer Science, 96 (1), 1992.
M. Silva and T. Murata. B-fairness and structural B-fairness in Petri net models of concurrent systems. lournal of Computer and System Sciences, 44: 447–477, 1992.
I. Suzuki and T. Kasami. Three measures for synchronic dependence in Petri nets. Acta Inform., 19: 325–338, 1983.
W. Reisig. Petri Nets. An Introduction. EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1985.
P.S. Thiagarajan H.J. Genrich, K. Lautenbach. Elements of general net theory. In W. Brauer, editor, Net Theory and Applications, number 84 in LNCS. Springer-Verlag, 1980.
C.A. Petri. An outline of general net theory. Unpublished manuscript, 1992.
U. Goltz. Synchronic distance. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri Nets: Central Models and Their Properties, number 254 in LNCS. Springer-Verlag, 1987.
T.W. Hungeford. Algebra. Springer-Verlag, 1974.
W. Reisig. Place/transition systems. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri Nets: Central Models and Their Properties, number 254 in LNCS. Springer-Verlag, 1987.
L. Bernardinello. Synthesis of net systems. In Proceedings of 14th International Conference on Application and Theory of Petri Nets, Chicago (USA), 1993.
K. Petruni. Verso una caratterizzazione algebrica della distanza sincronica. Università degli studi di Milano, Tesi di Laurea, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 British Computer Society
About this paper
Cite this paper
Bernardinello, L., De Michelis, G., Petruni, K., Vigna, S. (1995). On The Synchronic Structure of Transition Systems. In: Desel, J. (eds) Structures in Concurrency Theory. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3078-9_5
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3078-9_5
Publisher Name: Springer, London
Print ISBN: 978-3-540-19982-3
Online ISBN: 978-1-4471-3078-9
eBook Packages: Springer Book Archive