Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Unbounded Petri Net Synthesis

  • Chapter
Lectures on Concurrency and Petri Nets (ACPN 2003)

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

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook
USD 15.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  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)

    Chapter  Google Scholar 

  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. Badouel, E., Bernardinello, L., Darondeau, P.: The Synthesis Problem for Elementary Net Systems is NP-complete. Theoretical Computer Science 186, 107–134 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  4. Badouel, E., Caillaud, B., Darondeau, P.: Distributing finite automata through Petri net synthesis. Formal Aspects of Computing 13, 447–470 (2002)

    Article  MATH  Google Scholar 

  5. Badouel, E.: Darondeau, P.: On the Synthesis of General Petri Nets. Inria Research Report 3025 (1996)

    Google Scholar 

  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. Badouel, E.: Darondeau, P.: The Synthesis of Petri Nets from Path-Automatic Specifications, draft (2003) (submitted)

    Google Scholar 

  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)

    Chapter  Google Scholar 

  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. Berstel, J.: Transductions and Context-Free Languages. Teubner Verlag, Stuttgart (1979)

    MATH  Google Scholar 

  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. Bernardinello, L., Ferrigato, C., Pomello, L.: An Algebraic Model of Observable Properties in Distributed Systems. Theoretical Computer Science 290, 637–678 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  13. Bracho, F., Droste, M.: Labelled Domains and Automata with Concurrency Relations. Theoretical Computer Science 135(2), 289–318 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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)

    Chapter  Google Scholar 

  19. Darondeau, P.: On the Petri net realization of context-free graphs. Theoretical Computer Science 258, 573–598 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  20. Desel, J., Reisig, W.: The Synthesis Problem of Petri Nets. Acta Informatica 33, 297–315 (1996)

    Article  MathSciNet  Google Scholar 

  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. Ehrenfeucht, A., Rozenberg, G.: Partial (Set) 2-Structures; Part I: Basic Notions and the Representation Problem. Acta Informatica 27, 315–342 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  23. Ehrenfeucht, A., Rozenberg, G.: Partial (Set) 2-Structures; Part II: State Spaces of Concurrent Systems. Acta Informatica 27, 343–368 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  24. Esparza, J.: Decidability of model-checking for infinite-state concurrent systems. Acta Informatica 34(2), 85–107 (1997)

    Article  MathSciNet  Google Scholar 

  25. Fernau, H.: Parallel Communicating Grammar Systems with Terminal Transmission. Acta Informatica 37, 511–540 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  26. Fischer, P.C., Rosenberg, A.L.: Multitape One-Way Nonwriting Automata. Journal of Computer and System Sciences 2, 88–101 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  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. Ginsburg, S., Spanier, E.H.: Bounded Algol-like Languages. Transactions of the American Mathematical Society, 333–368 (1964)

    Google Scholar 

  29. Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas, and Languages. Pacific Journal of Mathematics 16, 285–296 (1966)

    MATH  MathSciNet  Google Scholar 

  30. Ginsburg, S., Spanier, E.H.: AFL with the Semilinear Property. Journal of Computer and System Sciences 5, 365–396 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  31. Harrisson, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Reading (1978)

    Google Scholar 

  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. 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. Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  35. Ibarra, O.: Simple Matrix Languages. Information and Control 17, 359–394 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  36. Mayr, E.: An Algorithm for the General Petri Net Reachability Problem. SIAM Journal on Computing 13, 441–460 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  37. Mukund, M.: Petri Nets and Step Transition Systems. International Journal of Foundations of Computer Science 3(4), 443–478 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  38. Nielsen, M., Rozenberg, G., Thiagarajan, P.S.: Elementary Transition Systems. Theoretical Computer Science 96(1), 3–33 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  41. Schrijver, A.: Theory of Linear and Integer Programming. John Wiley, Chichester (1986)

    MATH  Google Scholar 

  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. Sénizergues, G.: unpublished work communicated to the author

    Google Scholar 

  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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRISA, campus de Beaulieu, F35042, Rennes Cedex, France

    Philippe Darondeau

Authors
  1. Philippe Darondeau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Applied Computer Science, Catholic University of Eichstätt-Ingolstadt,  

    Jörg Desel

  2. Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099, Berlin, Germany

    Wolfgang Reisig

  3. , Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Darondeau, P. (2004). Unbounded Petri Net Synthesis. In: Desel, J., Reisig, W., Rozenberg, G. (eds) Lectures on Concurrency and Petri Nets. ACPN 2003. Lecture Notes in Computer Science, vol 3098. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27755-2_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27755-2_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22261-3

  • Online ISBN: 978-3-540-27755-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation