Advertisement

Unbounded Petri Net Synthesis

  • Philippe Darondeau
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3098)

Abstract

We address the problem of deciding uniformly for graphs or languages of a given class whether they are generated by unlabelled Place-Transition nets whose sets of reachable markings may be infinite.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alur, R., Yannakakis, M.: Model Checking of Message Sequence Charts. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 114–129. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  2. 2.
    Badouel, E., Bernardinello, L., Darondeau, P.: Polynomial Algorithms for the Synthesis of Bounded Nets. In: Mosses, P.D., Schwartzbach, M.I., Nielsen, M. (eds.) CAAP 1995, FASE 1995, and TAPSOFT 1995. LNCS, vol. 915, pp. 647–679. Springer, Heidelberg (1995)Google Scholar
  3. 3.
    Badouel, E., Bernardinello, L., Darondeau, P.: The Synthesis Problem for Elementary Net Systems is NP-complete. Theoretical Computer Science 186, 107–134 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Badouel, E., Caillaud, B., Darondeau, P.: Distributing finite automata through Petri net synthesis. Formal Aspects of Computing 13, 447–470 (2002)zbMATHCrossRefGoogle Scholar
  5. 5.
    Badouel, E.: Darondeau, P.: On the Synthesis of General Petri Nets. Inria Research Report 3025 (1996)Google Scholar
  6. 6.
    Badouel, E., Darondeau, P.: Theory of regions. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 529–586. Springer, Heidelberg (1998)Google Scholar
  7. 7.
    Badouel, E.: Darondeau, P.: The Synthesis of Petri Nets from Path-Automatic Specifications, draft (2003) (submitted)Google Scholar
  8. 8.
    Bednarczyk, M., Borzyszkowski, A.: On Concurrent Realization of Reactive Systems and their Morphisms. In: Ehrig, H., Juhás, G., Padberg, J., Rozenberg, G. (eds.) APN 2001. LNCS, vol. 2128, pp. 346–379. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  9. 9.
    Bernardinello, L., De Michelis, G., Petruni, K., Vigna, S.: On the Synchronic Sructure of Transition Systems. In: Desel, J. (ed.) Structures in Concurrency Theory, Workshops on Computing, pp. 11–31. Springer, Heidelberg (1996)Google Scholar
  10. 10.
    Berstel, J.: Transductions and Context-Free Languages. Teubner Verlag, Stuttgart (1979)zbMATHGoogle Scholar
  11. 11.
    Bernardinello, L.: Synthesis of Net Systems. In: Ajmone Marsan, M. (ed.) ICATPN 1993. LNCS, vol. 691, pp. 11–31. Springer, Heidelberg (1993)Google Scholar
  12. 12.
    Bernardinello, L., Ferrigato, C., Pomello, L.: An Algebraic Model of Observable Properties in Distributed Systems. Theoretical Computer Science 290, 637–678 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Bracho, F., Droste, M.: Labelled Domains and Automata with Concurrency Relations. Theoretical Computer Science 135(2), 289–318 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Caillaud, B., Darondeau, P., Helouet, L., Lesventes, G.: HMSCs as partial specifications.. with pNs as completions. In: Cassez, F., Jard, C., Rozoy, B., Dermot, M. (eds.) MOVEP 2000. LNCS, vol. 2067, pp. 125–152. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  15. 15.
    Chernikova, N.: Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities. USSR Computational Mathematics and Mathematical Physics 5(2), 228–233 (1965)zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Cortadella, J., Kishinevsky, M., Kondratyev, A., Lavagno, L., Yakovlev, A.: Hardware and Petri Nets: Application to Asynchronous Circuit Design. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol. 1825, pp. 1–15. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  17. 17.
    Cortadella, J., Kishinevsky, M., Lavagno, L., Yakovlev, A.: Deriving Petri Nets from Finite Transition Systems. IEEE Transactions on Computers 47(8), 859–882 (1998)CrossRefMathSciNetGoogle Scholar
  18. 18.
    Darondeau, P.: Deriving Petri Nets from Formal Languages. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 533–548. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  19. 19.
    Darondeau, P.: On the Petri net realization of context-free graphs. Theoretical Computer Science 258, 573–598 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    Desel, J., Reisig, W.: The Synthesis Problem of Petri Nets. Acta Informatica 33, 297–315 (1996)CrossRefMathSciNetGoogle Scholar
  21. 21.
    Droste, M., Shortt, R.M.: Petri Nets and Automata with Concurrency Relations - an Adjunction. In: Droste, M., Gurevich, Y. (eds.) Semantics of Programming Languages and Model Theory, pp. 69–87 (1993)Google Scholar
  22. 22.
    Ehrenfeucht, A., Rozenberg, G.: Partial (Set) 2-Structures; Part I: Basic Notions and the Representation Problem. Acta Informatica 27, 315–342 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  23. 23.
    Ehrenfeucht, A., Rozenberg, G.: Partial (Set) 2-Structures; Part II: State Spaces of Concurrent Systems. Acta Informatica 27, 343–368 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  24. 24.
    Esparza, J.: Decidability of model-checking for infinite-state concurrent systems. Acta Informatica 34(2), 85–107 (1997)CrossRefMathSciNetGoogle Scholar
  25. 25.
    Fernau, H.: Parallel Communicating Grammar Systems with Terminal Transmission. Acta Informatica 37, 511–540 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  26. 26.
    Fischer, P.C., Rosenberg, A.L.: Multitape One-Way Nonwriting Automata. Journal of Computer and System Sciences 2, 88–101 (1968)zbMATHCrossRefMathSciNetGoogle Scholar
  27. 27.
    Ghaffari, A., Rezg, N., Xie, X.: Live and Maximally Permissive Controller Synthesis using Theory of Regions. In: Caillaud, B., Darondeau, P., Lavagno, L., Xie, X. (eds.) Synthesis and Control of Discrete Event Systems. Kluwer Academic Publishers, Dordrecht (2002)Google Scholar
  28. 28.
    Ginsburg, S., Spanier, E.H.: Bounded Algol-like Languages. Transactions of the American Mathematical Society, 333–368 (1964)Google Scholar
  29. 29.
    Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas, and Languages. Pacific Journal of Mathematics 16, 285–296 (1966)zbMATHMathSciNetGoogle Scholar
  30. 30.
    Ginsburg, S., Spanier, E.H.: AFL with the Semilinear Property. Journal of Computer and System Sciences 5, 365–396 (1971)zbMATHCrossRefMathSciNetGoogle Scholar
  31. 31.
    Harrisson, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Reading (1978)Google Scholar
  32. 32.
    Holzer, M., Kutrib, M.: Flip-Pushdown Automata: k+1 Pushdown Reversals are Better than k. IFIG Research Report 0206, Universitaet Giessen (2002)Google Scholar
  33. 33.
    Hoogers, P.W., Kleijn, H.C.M., Thiagarajan, P.S.: A Trace Semantics for Petri Nets. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 595–604. Springer, Heidelberg (1992)Google Scholar
  34. 34.
    Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)zbMATHGoogle Scholar
  35. 35.
    Ibarra, O.: Simple Matrix Languages. Information and Control 17, 359–394 (1970)zbMATHCrossRefMathSciNetGoogle Scholar
  36. 36.
    Mayr, E.: An Algorithm for the General Petri Net Reachability Problem. SIAM Journal on Computing 13, 441–460 (1984)zbMATHCrossRefMathSciNetGoogle Scholar
  37. 37.
    Mukund, M.: Petri Nets and Step Transition Systems. International Journal of Foundations of Computer Science 3(4), 443–478 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  38. 38.
    Nielsen, M., Rozenberg, G., Thiagarajan, P.S.: Elementary Transition Systems. Theoretical Computer Science 96(1), 3–33 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  39. 39.
    Pelz, E.: Closure Properties of Deterministic Petri Nets. In: Brandenburg, F.J., Wirsing, M., Vidal-Naquet, G. (eds.) STACS 1987. LNCS, vol. 247, pp. 373–382. Springer, Heidelberg (1987)CrossRefGoogle Scholar
  40. 40.
    Ramadge, P.J., Wonham, W.M.: Supervisory Control of a Class of Discrete Event Processes. SIAM Journal of Control and Optimization 25(1), 206–230 (1987)zbMATHCrossRefMathSciNetGoogle Scholar
  41. 41.
    Schrijver, A.: Theory of Linear and Integer Programming. John Wiley, Chichester (1986)zbMATHGoogle Scholar
  42. 42.
    Sénizergues, G.: Definability in weak monadic second order logic of some infinite graphs. Dagstuhl seminar on Automata theory: Infinite computations, Wadern 28, 16 (1992)Google Scholar
  43. 43.
    Sénizergues, G.: unpublished work communicated to the authorGoogle Scholar
  44. 44.
    Vogler, W.: Concurrent Realization of Asynchronous Transition Systems. In: Donatelli, S., Kleijn, J. (eds.) ICATPN 1999. LNCS, vol. 1639, pp. 284–303. Springer, Heidelberg (1999)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Philippe Darondeau
    • 1
  1. 1.IRISARennes CedexFrance

Personalised recommendations