Abstract
We introduce a subclass of Valk's self-modifying nets. The considered nets appear as stratified sums of ordinary nets and they arise as a counterpart to cascade products of automata via the duality between automata and nets based on regions in automata. Nets in this class, called stratified nets, cannot exhibit circular dependences between places: inscriptions on flow arcs attached to a given place, depend at most on the contents of places in lower layers. Therefore, the synthesis problem has similar degrees of complexity for (ordinary) nets and for stratified nets, hence it is tractable.
This work was partly supported by the H.C.M. network Express.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Badouel, E., Bernardinello, L. and Darondeau, Ph., Polynomial algorithms for the synthesis of bounded nets, Proceedings Caap 95, Lecture Notes in Computer Science 915 (1995) 647–679.
Badouel, E., and Darondeau, Ph., On the synthesis of General Petri Nets, Inria Research Report 3025 (1996).
Berge, C., Graphes et hypergraphes. Dunod, Paris (1970). English translation: Graphs and Hypergraphs, North Holland, Amsterdam (1973).
Ehrenfeucht, A., and Rozenberg, G., Partial 2-structures; Part I: Basic Notions and the Representation Problem, and Part II: State Spaces of Concurrent Systems, Acta Informatioa, vol 27 (1990).
Ginzburg, A., Algebraic Theory of Automata. Academic Press, New-York (1968).
Harrison, M. A., Lectures on Linear Sequential Machines. Academic Press (1969).
Karp, R.M., and Miller, R.E., Parallel program schemata. Journal of Computer and System Sciences vol. 3 (1969) 147–195.
Krohn, K., and Rhodes, J.L., Algebraic Theory of Machines, I: Principles of Finite Semigroups and Machines. Transaction of the American Mathematical Society 116 (1965) 450–464.
Lefschetz, S., Applications of Algebraic Topology. Applied Mathematical Science 16, Spinger-Verlag (1975).
Miller, R., Parrow, J., and Walker, D., A calculus of mobile Processes, I–II. Information and Computation, vol. 100, no 1, (1992) 1–40 and 41–77.
Mukund, M., Petri Nets and Step Transition Systems. International Journal of Foundatations of Computer Science vol. 3, no 4 (1992) 443–478.
Schrijver, A., Theory of Linear and Integer Programming. John Wiley (1986).
Valk, R., Self-Modifying Nets, a Natural Extension of Petri Nets. Icalp'78, Lecture Notes in Computer Science vol. 62 (1978) 464–476.
Valk, R., Generalizations of Petri Nets. MFCS'81, Lecture Notes in Computer Science vol. 118 (1981) 140–155. *** DIRECT SUPPORT *** A0008123 00004
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Badouel, E., Darondeau, P. (1997). Stratified petri nets. In: Chlebus, B.S., Czaja, L. (eds) Fundamentals of Computation Theory. FCT 1997. Lecture Notes in Computer Science, vol 1279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036176
Download citation
DOI: https://doi.org/10.1007/BFb0036176
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63386-0
Online ISBN: 978-3-540-69529-5
eBook Packages: Springer Book Archive