Unbounded Petri net synthesis

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

Volumn 3098, Issue , 2004, Pages 413-438

  Darondeau, Philippe ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

NET SYNTHESIS; PLACE TRANSITION NET;

PETRI NETS;

EID: 26444565779     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27755-2_11     Document Type: Article

References (44)

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