Theory of regions

  • Eric Badouel
  • Philippe Darondeau
II Analysis and Synthesis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1491)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Badouel, E., Splitting of Actions, Higher-Dimensional Automata and Net Synthesis. Inria Research Report No 3013 (1996).Google Scholar
  2. [2]
    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.Google Scholar
  3. [3]
    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.Google Scholar
  4. [4]
    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.Google Scholar
  5. [5]
    Adouel E. and Darondeau, Ph.Trace nets and process automata, Acta Informatica 32 (1995) 647–679.Google Scholar
  6. [6]
    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.Google Scholar
  7. [7]
    Badouel, E., and Darondeau, Ph., On the Synthesis of General Petri Nets. Inria Research Report No 3025 (1996).Google Scholar
  8. [8]
    Badouel, E., and Darondeau, Ph., Stratified Petri Nets. Inria Research Report No 3128 (1997).Google Scholar
  9. [9]
    Bednarczyk, M. A., Categories of Asynchronous Systems. Ph. D. Thesis, University of Sussex (1988).Google Scholar
  10. [10]
    Berge, C., Graphes et hypergraphes. Dunod, Paris (1970). English translation: Graphs and Hypergraphs, North Holland, Amsterdam (1973).Google Scholar
  11. [11]
    Bernardinello, L., Synthesis of Net Systems. Application and Theory of Petri Nets, Lecture Notes in Computer Science 691 (1993) 89–105.Google Scholar
  12. [12]
    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.Google Scholar
  13. [13]
    Caillaud, B., Synet: un outil de synthése de réseaux de Petri bornés, applications Irisa Research Report no 1101 (1997).Google Scholar
  14. [14]
    Cortadella, J., Kishinevsky, M., Lavagno, L., and Yakovlev, A., Synthesizing Petri Nets from State-Based Models. Proceedings of ICCAD'95 (1995) 164–171.Google Scholar
  15. [15]
    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.Google Scholar
  16. [16]
    Chen, W.K., Applied Graph Theory. North-Holland (1971).Google Scholar
  17. [17]
    Christofides, N., Graph Theory — An Algorithmic Approach. Academic Press (1975).Google Scholar
  18. [18]
    Davey, B.A., and Priestley, H.A., Introduction to Lattices and Order. Cambridge University Press, (1990).Google Scholar
  19. [19]
    Desel, J., and Reisig, W., The Synthesis Problem of Petri Nets. Acta Informatica vol. 33 (1996) 297–315.Google Scholar
  20. [20]
    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.Google Scholar
  21. [21]
    Droste, M., and Shortt, R.M., Prom Petri Nets to Automata with Concurrency. Draft communicated to the authors.Google Scholar
  22. [22]
    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).Google Scholar
  23. [23]
    Garey, M.R., and Johnson, D.S., Computer and Intractability. A guide to the theory of NP-Completeness. W.H. Freeman and Company (1979).Google Scholar
  24. [24]
    Gondran, M., and Minoux, M., Graphes et algorithmes. Eyrolles,Paris (1979). English translation by Steven Vajda: Graphs and Algorithms, John Wiley (1984).Google Scholar
  25. [25]
    Hiraishi, K., Some complexity results on transition systems and elementary net systems. Theoretical Computer Science 135 (1994) 361–376.Google Scholar
  26. [26]
    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.Google Scholar
  27. [27]
    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.Google Scholar
  28. [28]
    Johnstone, P.T., Stone Spaces. Cambridge University Press, (1982).Google Scholar
  29. [29]
    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).Google Scholar
  30. [30]
    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).Google Scholar
  31. [31]
    Lefschetz, S., Applications of Algebraic Topology. Applied Mathematical Science 16, Spinger-Verlag (1975).Google Scholar
  32. [32]
    Liu, C.L., Introduction to Combinatorial Mathematics. Mac Graw Hill (1968).Google Scholar
  33. [33]
    Mukund, M., Petri Nets and Step Transition Systems. International Journal of Foundation of Computer Science, vol 3, no 4 (1992) 443–478.Google Scholar
  34. [34]
    Nielsen, M., Rgzenberg, G., and Thiagarajan, P.S., Elementary Transition Systems. Theoretical Computer Science, vol. 96 (1992) 3–33.Google Scholar
  35. [35]
    Nielsen, M., and Winskel, G., Models for Concurrency, Handbook of Logic for Computer Science, vol. 4, Oxford University Press (1995).Google Scholar
  36. [36]
    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.Google Scholar
  37. [37]
    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.Google Scholar
  38. [38]
    Schrijver, A., Theory of Linear and Integer Programming. John Wiley (1986).Google Scholar
  39. [39]
    Schmitt, V., Flip-Flop Nets, Proceedings of Stacs 96, Lecture Notes in Computer Science vol. 1046 (1996) 517–528.Google Scholar
  40. [40]
    Tutte, W.T., Graph Theory. Encyclopedia of Mathematics and its Application vol. 21, Addison-Wesley (1984).Google Scholar
  41. [41]
    Shields, M.W., Concurrent machines, The Computer Journal, vol. 28 (1985) 449–465.Google Scholar
  42. [42]
    Stark, E.W., Connections between a Concrete and an Abstract Model of Concurrent Systems. 5th Mathematical Foundation of Programming Semantics (1989) 53–79.Google Scholar
  43. [43]
    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.Google Scholar
  44. [44]
    Valk, R., Generalizations of Petri Nets. Proceedings of MFCS'81, Lecture Notes in Computer Science vol. 118 (1981) 140–155.Google Scholar

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • Eric Badouel
    • 1
  • Philippe Darondeau
    • 1
  1. 1.IrisaRennes CedexFrance

Personalised recommendations