Deriving unbounded Petri nets from formal languages

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


We propose decision procedures based on regions for two problems on pure unbounded Petri nets with injective labelling. One problem is to construct nets from incomplete specifications, given by pairs of regular languages that impose respectively upper and lower bounds on the expected behaviours. The second problem is to derive equivalent nets from deterministic pushdown automata, thus exhibiting their hidden concurrency.


Rational Region Regular Expression Regular Language Finite Deterministic Automaton Left Factor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [ABB97]
    Autebert, J.M., Berstel, J., and Boasson, L., Context-Free Languages and Pushdown Automata. In vol. 1 of “Handbook of Formal Languages”, G. Rozenberg and A. Salomaa eds., Springer-Verlag (1997) 111–174Google Scholar
  2. [BBD95]
    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. [BD96]
    Badouel, E. and Darondeau, Ph., On the Synthesis of General Petri Nets, Inria Research Report no 3025 (1996).Google Scholar
  4. [BDPV96]
    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
  5. [BH96]
    Bouajjani, A., and Habermehl, P., Constrained Properties, Semilinear Systems, and Petri Nets. Proceedings Concur 95, Lecture Notes in Computer Science 1119 (1995) 481–497.MathSciNetGoogle Scholar
  6. [Ca97]
    Caillaud, B., Synet: un outil de synthèse de réseaux de Petri bornés, applications Inria Research Report no 3155 (1997).Google Scholar
  7. [CKLY95]
    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
  8. [DR96]
    Desel, J., and Reisig, W., The Synthesis Problem of Petri Nets. Acta Informatica, vol. 33 (1996) 297–315.zbMATHMathSciNetCrossRefGoogle Scholar
  9. [DS92]
    Droste, M., and Shortt, R.M., Bounded Petri Nets of Finite Dimension Have Only Finitely Many Reachable Markings. EATCS Bulletin No.48 (1992) 172–175.Google Scholar
  10. [DS93]
    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
  11. [ER90a]
    Ehrenfeucht, A., and Rozenberg, G., Partial (Set) 2-Structures; Part I: Basic Notions and the Representation Problem. Acta Informatica, vol. 27 (1990) 315–342.zbMATHMathSciNetCrossRefGoogle Scholar
  12. [ER90b]
    Ehrenfeucht, A., and Rozenberg, G., Partial (Set) 2-Structures; Part II: State Spaces of Concurrent Systems. Acta Informatica, vol. 27 (1990) 343–368.zbMATHMathSciNetGoogle Scholar
  13. [Har78]
    Harrisson, M.A., Introduction to Formal Language Theory. Addison-Wesley (1978).Google Scholar
  14. [JM95]
    Jancar, P., and Moller, F., Checking Regular Properties of Petri Nets, Proceedings Concur 95, Lecture Notes in Computer Science 962 (1995) 348–362.Google Scholar
  15. [Muk92]
    Mukund, M., Petri Nets and Step Transition Systems. International Journal of Foundations of Computer Science, vol. 3 no. 4 (1992) 443–478.zbMATHMathSciNetCrossRefGoogle Scholar
  16. [MR97]
    Mauw, S. and Reniers, M.A., High-level Message Sequence Charts. Proceedings of the Eighth SDL Forum, North-Holland (1997).Google Scholar
  17. [Ra78]
    Rackoff, C., The Covering and Boundedness Problems for Vector Addition Systems. Theoretical Computer Science, vol. 6 (1978) 223–231.zbMATHMathSciNetCrossRefGoogle Scholar
  18. [RY86]
    Rosier, L.E., and Yen, H.C., A Multiparameter Analysis of the Boundedness Problem for Vector Addition Systems. Journal of Computer and System Science, vol. 32 (1986) 105–135.zbMATHMathSciNetCrossRefGoogle Scholar
  19. [Sch86]
    Schrijver, A., Theory of Linear and Integer Programming. John Wiley (1986).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Philippe Darondeau
    • 1
  1. 1.IrisaRennes CedexFrance

Personalised recommendations