The synthesis of Petri nets from path-automatic specifications

Information and Computation

Volumn 193, Issue 2, 2004, Pages 117-135

  Badouel, E ^a   Darondeau, Ph ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

Automatic graphs; Modal transitions; Petri nets; Specifications; Synthesis

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DECISION MAKING; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING;

AUTOMATIC GRAPHS; MODAL TRANSITIONS; PATH-AUTOMATIC SPECIFICATIONS;

PETRI NETS;

EID: 4243158495     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2004.04.004     Document Type: Article

References (29)

1. E. Badouel, L. Bernardinello, Ph. Darondeau, Polynomial algorithms for the synthesis of bounded nets, in: Proceedings of CAAP, LNCS, Springer-Verlag, New York, vol. 915, 1995, pp. 647-679.
2. Badouel E., Caillaud B., Darondeau Ph. Distributing finite automata through Petri net synthesis. Formal Aspects of Computing. 13:2002;447-470.
3. E. Badouel, Ph. Darondeau, Theory of regions, in: Lectures on Petri Nets I: Basic Models, LNCS, Springer-Verlag, Berlin, vol. 1491, 1998, pp. 529-586.
4. Berstel J. Transductions and Context-Free Languages. 1979;Teubner Verlag.
5. A. Blumensath, E. Grädel, Automatic structures, in: Proceedings of LICS, IEEE, New York, 2000, pp. 51-62.
6. 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):1965;228-233.
7. Ph. Darondeau, Deriving Petri nets from formal languages, in: Proceedings of CONCUR, LNCS, Springer-Verlag, vol. 1466, 1998, pp. 533-548.
8. Darondeau Ph. On the Petri net realization of context-free graphs. Theoretical Computer Science. 258:2001;573-598.
9. M. Droste, R.M. Shortt, Petri nets and automata with concurrency relations - an adjunction, in: M. Droste, Y. Gurevich (Eds.), Semantics of Programming Languages and Model Theory, 1993, pp. 69-87.
10. Ehrenfeucht A., Rozenberg G. Partial (set) 2-structures; Part I: basic notions and the representation problem. Acta Informatica. 27:1990;315-342.
11. Ehrenfeucht A., Rozenberg G. Partial (set) 2-structures; Part II: state spaces of concurrent systems. Acta Informatica. 27:1990;343-368.
12. Eilenberg S., Schützenberger M.P. Rational sets in commutative monoids. Journal of Algebra. 13:1969;173-191.
13. Epstein D., Cannon J., Holt D., Levy S., Paterson M., Thurston W. Word Processing in Groups. 1992;Jones and Bartlett Publishers.
14. Ginsburg S., Spanier E.H. Bounded algol-like languages. Transactions of the American Mathematical Society. 1964;333-368.
15. Ginsburg S., Spanier E.H. Semigroups, Presburger formulas, and languages. Pacific Journal of Mathematics. 16:1966;285-296.
16. Gruber P.M., Wills J.M. Handbook of Convex Geometry. 1993;North-Holland, Amsterdam.
17. Huynh T.D. The complexity of semilinear sets. Elektronische Informationsverarbeitung und Kybernetik. 18(6):1982;291-338.
18. Johnson J.H. Rational equivalence relations. Theoretical Computer Science. 47:1986;39-60.
19. B. Khoussainov, A. Nerode, Automatic presentations of structures, in: Proceedings of LCC, LNCS, Springer-Verlag, New York, vol. 960, 1994, pp. 367-392.
20. K.G. Larsen, Modal specifications, in: Proceedings of the Automatic Verification Methods for Finite Transition Systems, LNCS, Springer-Verlag, New York, vol. 407, 1989, pp. 232-246.
21. K.G. Larsen, B. Thomsen, A modal process logic, in: Proceedings of LICS, IEEE Computer Society Press, Silver Spring, MD, 1988, pp. 203-210.
22. Ch. Morvan, On rational graphs, in: Proceedings of the Foundations of Software Science and Computation Structures, LNCS, Springer-Verlag, New York, vol. 1784, 2000, pp. 252-266.
23. Ch. Morvan, Les graphes rationnels, Ph.D. thesis, University of Rennes I, 2002.
24. Mukund M. Petri nets and step transition systems. International Journal of Foundations of Computer Science. 3(4):1992;443-478.
25. L. Pélecq, Isomorphismes et automorphismes des graphes context-free, équationnels et automatiques, Ph.D. thesis, University of Bordeaux I, 1997.
26. Schrijver A. Theory of Linear and Integer Programming. 1986;Wiley, New York.
27. G. Sénizergues, Definability in weak monadic second order logic of some infinite graphs, Dagstuhl Seminar on Automata Theory: Infinite Computations, Wadern, vol. 28, 1992, p. 16.
28. G. Sénizergues, unpublished work communicated to the authors.
29. W. Thomas, A short introduction to infinite automata, in: Proceedings of the International Conference on Developments in Language Theory 2001, LNCS, Springer-Verlag, New York, vol. 2295, 2002, pp. 130-144.