Deriving unbounded petri nets from formal languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1466, Issue , 1998, Pages 533-548

  Darondeau, Philippe ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES;

DECISION PROCEDURE; DETERMINISTIC PUSHDOWN AUTOMATA; UPPER AND LOWER BOUNDS;

PETRI NETS;

EID: 84945977925     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055646     Document Type: Conference Paper

References (19)

1. 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-174
2. BADOUEL E., BERNARDINELLO, L., and DARONDEAU PH., polynomial algorilhms for the synthesis of bounded nets, Proceedings Caap 95, Lecture Notes in Computer Science 915 (1995) 647-679.
3. BADOUEL E., DARONDEAU PH., On the Synthesis of General Petri Nets, Inria Research Report no 3025 (1996).
4. BERNARDINELLO, L., DE MICHELIS, G., PBTRUNI, K., and VIGNA, S., On the Synchronic Structure of Transitions Systems. In "Structures in Concurrency Theory", J. Desel ed., Springer-Verlag (1996) 11-31.
5. BOUAJJANI, A., and HABERMEHL, P., Constrained Properties, Semilinear Systems, and Petri Nets. Proceedings Concur 95, Lecture Notes in Computer Science 1119 (1995) 481-497.
6. CAILLAUD, B., SYNET: un outil de synthése de réseaux de Petri bornés, applications Inria Research Report no 3155 (1997).
7. CORTADELLA, J., KISHINEVSKY, M., LAVAGNO, L., AND YAKOVLEV, A., Synthesizing Petri Nets from State- Itased Models. Prceedings of ICCAD’95 (1995) 164 171.
8. DESEL, J., AND RESIG, W., The Synthesis Problem of petri Nets. Acta lnformatica, vol. 33 (1996) 297-315.
9. DROSTE M., and SHORTT, R.M., Bounded Petri Nets of Finite Dimension Have Only Finitely Many Reachable Markings. EATCS Bulletin №48 (1992) 172-175.
10. DROSTE M., and SHORTT, R.M., Petri Nets and Automata with Concurrency Relations - an Adjunction. in "Semantics of Programming Languages and Model Theory", M. Drostc and Y. Gurcvich eds(1993) 69-87.
11. EHRENEUCHT, A., ROZENBERG, G., Partial (Set) 2-Structures; Part I: Basic Notions and the Representation Problem. Acta Informatica, vol. 27 (1990) 315-342.
12. EHRENEUCHT, A., ROZENBERG, G., Partial (Set) 2-Structures; Part, II: State Spaces o1 Concurrent Systems. Acta Informatica, vol. 27 (1990) 343-368.
13. HARRISSON, M.A., Introduction to Formal Language Theory. Addison-Wesley (1978).
14. JANCAR, P., and MOLLER, F., Checking Regular Properties of Petri Nets, Proceedings Concur 95, Lecture Notes in Computer Science 962 (1995) 348-362.
15. MUKUND, M., Petri Nets and Step Transition Systems. International Journal of Foundations of Computer Science, vol. 3 no. 4 (1992) 443-478.
16. MAUW, S. and RENIERS, M.A., High-level Message Sequence Charts. Proceedings of the Eighth SDL Forum, North-Holland (1997).
17. RACKOFF, G., The Covering and Boundedness Problems for Vcctor Addition Systems. Theoretical Computer Science, vol. 6 (1978) 223-231.
18. ROSIER, L. E., and YEN, H. C., A Multiparameter Analysis of the Boundedness Problem for Vc.etor Addition Systems. Journal of Comlmter and System Science, vol. 32 (1986) 105-135.
19. SCHRIJVER A., Theory of Linear and Integer Programming. John Wiley (1986).