Polynomial algorithms for the synthesis of bounded nets

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

Volumn 915, Issue , 1995, Pages 364-378

  Badouel, Eric ^a   Bernardinello, Luca ^a   Darondeau, Philippe ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PETRI NETS; POLYNOMIAL APPROXIMATION;

ELEMENTARY NET; EXPLICIT ALGORITHMS; POLYNOMIAL ALGORITHM; POLYNOMIAL-TIME; SYNTHESIS PROBLEMS;

SOFTWARE DESIGN;

EID: 84957675725     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-59293-8_207     Document Type: Conference Paper

References (13)

1. [BBD95] Badouel, E., Bernardinello, L., and Darondeau, Ph., The Synthesis Problem for Elementary Net Systems is NP-Complete, Irisa/Inria research report to appear (1995).
2. [Ber70] Berge, C., Graphes et hypergraphes. Dunod, Paris (1970).
3. [Ber93] Bernardinello, L., Synthesis of Net Systems. Application and Theory of Petri Nets, Springer-Verlag Lecture Notes in Computer Science, vol. 691 (1993) 89-105.
4. [BDP93] Bernardinello, L., De Michelis, G., and Petruni, K., Synchronic distances as Generalized Regions. Rapporto Interno n. 107-93, Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano (1993).
5. [DR92] Desel, J., and Reisig, W., The Synthesis Problem of Petri Nets. TUM research report, Munich (1992).
6. [DS92] Droste, M., and Shortt, R. M., Bounded Petri Nets of Finite Dimension have only Finitely Many Reachable Markings. Bulletin of the European Association for Computer Science, number 48, (1992) 172-174.
7. [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.
8. [ER90] Ehrenfeucht, A., and Rozenberg, G., Partial 2-structures; Part I: Basic Notions and the Representation Problem, and Part II: State Spaces of Concurrent Systems, Acta Informatica, vol 27 (1990).
9. [GM85] Gondran, M., and Mlnoux, M., Graphes et algorithmes. Eyrolles, Paris (1985).
10. [Hir94] Hiraishi, K., Some complexity results on transitions systems and elementary net systems. Theoretical Computer Science 135 (1994) 361-376.
11. [HKT92] Hoogers, P. W., Kleijn, H. C. M., and Thiagarajan, P. S., A trace semantics for Petri nets. Springer-Verlag, Lecture Notes in Computer Science, vol. 623 (1992) 595-604.
12. [Muk93] MUKUND, M., Petri Nets and Step Transition Systems. International Journal of Foundation of Computer Science, vol 3, no. 3 (1993).
13. [Sch86] SCHRIJVER, A., Theory of Linear and Integer Programming. John Wiley (1986).