Abstract
The synthesis problem for nets consists in deciding whether a given graph is isomorphic to the marking graph of some net and then constructing it. This problem has been solved in the literature for various types of nets ranging from elementary nets to Petri nets. The general principle for the synthesis is to inspect regions of graphs representing extensions of places of the likely generating nets. We follow in this survey the gradual development of the theory of regions from its foundation by Ehrenfeucht and Rozenberg, with a particular insistence on the abstract meaning of the theory, which is a general product decomposition of graphs into atomic components determined by a parameter called a type of nets, and on the derivation of efficient algorithms for net synthesis based on linear algebra.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Badouel, E., Splitting of Actions, Higher-Dimensional Automata and Net Synthesis. Inria Research Report No 3013 (1996).
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., Bernardinello, L.and Darondeau, Ph., The synthesis problem for elementary net systems is NP-complete, Inria Research Report 2558 (1995). To appear in Theoretical Computer Science.
Badouel, E., and Darondeau, Ph., Trace Nets. REX workshop, Beekbergen “Semantics: Foundation and Applications”, Springer-Verlag Lecture Notes in Computer Science, vol. 666 (1993) 21–50.
Adouel E. and Darondeau, Ph.Trace nets and process automata, Acta Informatica 32 (1995) 647–679.
Badouel, E., and Darondeau, Ph., Dualities between Nets and Automata induced by Schizophrenic Objects, 6th International Conference on Category Theory and Computer Science, Cambridge, Lecture Notes in Computer Science, vol. 953 (1995) 24–43.
Badouel, E., and Darondeau, Ph., On the Synthesis of General Petri Nets. Inria Research Report No 3025 (1996).
Badouel, E., and Darondeau, Ph., Stratified Petri Nets. Inria Research Report No 3128 (1997).
Bednarczyk, M. A., Categories of Asynchronous Systems. Ph. D. Thesis, University of Sussex (1988).
Berge, C., Graphes et hypergraphes. Dunod, Paris (1970). English translation: Graphs and Hypergraphs, North Holland, Amsterdam (1973).
Bernardinello, L., Synthesis of Net Systems. Application and Theory of Petri Nets, Lecture Notes in Computer Science 691 (1993) 89–105.
Bernardinello, L., De Michelis, G., Petruni, K., and Vigna, S., On the Synchronic Structure of Transitions Systems. In “Structures in Concurrency Theory”, J. Desel ed., Springer-Verlag (1996) 11–31.
Caillaud, B., Synet: un outil de synthése de réseaux de Petri bornés, applications Irisa Research Report no 1101 (1997).
Cortadella, J., Kishinevsky, M., Lavagno, L., and Yakovlev, A., Synthesizing Petri Nets from State-Based Models. Proceedings of ICCAD'95 (1995) 164–171.
Cortadella, J., Kishinevsky, M., Kondratyev, A., Lavagno, L., and Yakovlev, A., Complete state encoding based on the theory of regions. Proceedings of the 2nd International Workshop on Advanced Research in Asynchronous Circuits and Systems (1996) 36–47.
Chen, W.K., Applied Graph Theory. North-Holland (1971).
Christofides, N., Graph Theory — An Algorithmic Approach. Academic Press (1975).
Davey, B.A., and Priestley, H.A., Introduction to Lattices and Order. Cambridge University Press, (1990).
Desel, J., and Reisig, W., The Synthesis Problem of Petri Nets. Acta Informatica vol. 33 (1996) 297–315.
Droste, M., and Shortt, R.M., Petri Nets and Automata with Concurrency Relations — an Adjunction. in “Semantics of Programming Languages and Model Theory”, M. Droste and Y. Gurevich eds(1993) 69–87.
Droste, M., and Shortt, R.M., Prom Petri Nets to Automata with Concurrency. Draft communicated to the authors.
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 Informatica, vol 27 (1990).
Garey, M.R., and Johnson, D.S., Computer and Intractability. A guide to the theory of NP-Completeness. W.H. Freeman and Company (1979).
Gondran, M., and Minoux, M., Graphes et algorithmes. Eyrolles,Paris (1979). English translation by Steven Vajda: Graphs and Algorithms, John Wiley (1984).
Hiraishi, K., Some complexity results on transition systems and elementary net systems. Theoretical Computer Science 135 (1994) 361–376.
Hoogers, P.W., Kleijn, H.C.M., and Thiagarajan, P.S., A Trace Semantics for Petri Nets. Lecture Notes in Computer Science vol. 623 (1992) 595–604.
Hoogers, P.W., Kleijn, H.C.M., and Thiagarajan, P.S., An Event Structure Semantics for General Petri Nets. Theoretical Computer Science, volume 153 (1996) 129–170.
Johnstone, P.T., Stone Spaces. Cambridge University Press, (1982).
Kishinevsky, M., Cortadella, J., Kondratyev, A., Lavagno, L., Taubin, A., and Yakovlev, A., Place Chart Nets and their Synthesis. Technical Report 96-2-003 2-003 Department of Computer Hardware, University of Aizu (1996).
Kishinevsky, M., Cortadella, J., Kondratyev, A., Lavagno, L., and Yakovlev, A., Synthesis of General Petri Nets. Technial Report 96-2-004, Department of Computer Hardware, University of Aizu (1996).
Lefschetz, S., Applications of Algebraic Topology. Applied Mathematical Science 16, Spinger-Verlag (1975).
Liu, C.L., Introduction to Combinatorial Mathematics. Mac Graw Hill (1968).
Mukund, M., Petri Nets and Step Transition Systems. International Journal of Foundation of Computer Science, vol 3, no 4 (1992) 443–478.
Nielsen, M., Rgzenberg, G., and Thiagarajan, P.S., Elementary Transition Systems. Theoretical Computer Science, vol. 96 (1992) 3–33.
Nielsen, M., and Winskel, G., Models for Concurrency, Handbook of Logic for Computer Science, vol. 4, Oxford University Press (1995).
Porst, H.-E., and Tholen, W., Concrete Dualities. In “Category Theory at Work”, H. Herrlich, and H.-E. Porst (eds.), Heldermann Verlag Berlin (1991) 111–136.
Pratt, V.R., The Stone Gamut: A Coordinatization of Mathematics, Proceedings of the 10th Symposium on Logics in Computer Science, IEEE Computer Society (1995) 444–454.
Schrijver, A., Theory of Linear and Integer Programming. John Wiley (1986).
Schmitt, V., Flip-Flop Nets, Proceedings of Stacs 96, Lecture Notes in Computer Science vol. 1046 (1996) 517–528.
Tutte, W.T., Graph Theory. Encyclopedia of Mathematics and its Application vol. 21, Addison-Wesley (1984).
Shields, M.W., Concurrent machines, The Computer Journal, vol. 28 (1985) 449–465.
Stark, E.W., Connections between a Concrete and an Abstract Model of Concurrent Systems. 5th Mathematical Foundation of Programming Semantics (1989) 53–79.
Valk, R., Self-Modifying Nets, a Natural Extension of Petri Nets. Proceedings of Icalp'78, Lecture Notes in Computer Science vol. 62 (1978) 464–476.
Valk, R., Generalizations of Petri Nets. Proceedings of MFCS'81, Lecture Notes in Computer Science vol. 118 (1981) 140–155.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Badouel, E., Darondeau, P. (1998). Theory of regions. In: Reisig, W., Rozenberg, G. (eds) Lectures on Petri Nets I: Basic Models. ACPN 1996. Lecture Notes in Computer Science, vol 1491. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-65306-6_22
Download citation
DOI: https://doi.org/10.1007/3-540-65306-6_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65306-6
Online ISBN: 978-3-540-49442-3
eBook Packages: Springer Book Archive