Railway traffic planning with Petri nets and constraint programming

Journal Europeen des Systemes Automatises

Volumn 33, Issue 8-9, 1999, Pages 959-975

  Benasser, Ahmer ^a   Yim, Pascal ^a  

^a ECOLE CENTRALE DE LILLE   (France)

Author keywords

Constraint programming; Modelling; Petri nets; Planning; Railway systems

Indexed keywords

EID: 0037836312     PISSN: 12696935     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (23)

1. ARAKI T., KASAMI T., "Some Decision Problems Related to the Reachability Problem for Petri Nets", Theoretical Computer Science, vol. 3, 1977, p. 85-104.
2. BERTHELOT G., "Transformations and Decompositions of Nets", Advances in Petri Nets 1986, Part I, Lecture Notes in Computer Science, vol. 254, 1986, p. 359-376.
3. BUDINAS B., "Decidability of the Petri Net Reachability Problem", Automation and Remote Control, vol. 49, num. 11, 1988, p. 1393-1422.
4. CHENG A., ESPARZA J., PALSBERG J., "Complexity Results for 1-Safe Nets", Theoretical Computer Science, vol. 147, num. 1-2, 1995, p. 117-136.
5. CHIOLA G., DUTHEILLET C., FRANCESCHINIS G., HADDAD S., "On Well-Formed Coloured Nets and their Symbolic Reachability Graph", Procedings of the Eleventh International Conference on Applications and Theory of Petri Nets, Paris (France), 1990, p. 387-410.
6. FINKEL A., "The Minimal Coverability Graph for Petri Nets", Advances in Petri Nets 1993, Lecture Notes in Computer Science, vol. 674, 1993, p. 210-243.
7. HACK M., "Decision Problems for Petri Nets and Vector Addition Systems", report num. MAC-TM 59, 1975, MIT Project MAC, Cambridge, MA.
8. HUBER P., JENSEN A., JEPSEN L., JENSEN K., "Towards Reachability Trees for High-Level Petri Nets", Advances in Petri nets 1984, in Lecture Notes in Computer Science, vol. 188, 1985, p. 215-233.
9. JAFFAR J., LASSEZ J.-L., "Constraint Logic Programming", Technical report, 1986, Department of Computer Science, Monash University, 39 pages.
10. JAFFAR J., LASSEZ J.-L., "Constraint Logic Programming", Proceedings of the 14th ACM Symposium on Principles Of Programming Langages POPL, Munich (Germany), 1987, p. 111-119.
11. JANTZEN M., VALK R., "Formal Properties of Place/Transition Nets", Net Theory and Application, Berlin, 1980, Springer, p. 165-212.
12. JANICKI R., KOUTNY M., "Optimal Simulations, Nets and Reachability Graphs", Advances in Petri Nets 1991, Lecture Notes in Computer Science, vol. 524, 1991, p. 205-226, Springer-Verlag.
13. JENSEN K., "Coloured Petri Nets: A High Level Language for System Design and Analysis", ROZENBERG G., Ed., Advances in Petri Nets 1990, vol. 483 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1990, p. 342-416.
14. JENSEN K., Coloured Petri Nets, Basic Concepts, Analysis Methods and Pratical Use, vol. 1 of EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1992.
15. KARP R. M., MILLER R. E., "Parallel Program Schemata", J. Comput. Systems Sci., vol. 3, 1969, p. 147-195.
16. KOSTIN A. E., "Deterministic Algorithm for Determining Reachability of Marking in a Petri Net", Automatic Control and Computer Sciences, vol. 24, num. 2, 1990, p. 13-19.
17. KRUCKEBERG, "Mathematical Methods for Calculating Invariants in Petri Nets", Advances in Petri nets 1987, in Lecture Notes in Computer Science, vol. 266, 1987, p. 104-131.
18. LAUTENBACH K., "Linear Algebraic Techniques for Predicate/Transitions Nets", Advances in Petri nets 1986, Part I, Lecture Notes in Computer Science, vol. 254, 1986, p. 142-167.
19. LINDQVIST M., "Parameterized Reachability Trees for Predicate/Transition Nets", Advances in Petri Nets 1993, Lecture Notes in Computer Science, vol. 674, 1993, p. 301-324.
20. MELZER S., ESPARZA J., "Checking System Properties Via Integer Programming", Lecture Notes in Computer Science, vol. 1058, 1996, p. 250-264.
21. MURATA T., "Petri Nets : Properties, Analysis and Applications", Proceedings of the IEEE, vol. 77, num. 4, 1989, p. 541-580.
22. RAUHAMAA M., "A Comparative Study of Methods for Efficient Reachability Analysis", Report num. A 14, 1990, Helsinki University of Technology, Digital Systems Laboratory, Otaniemi (Finland).
23. STARKE P., "Reachability Analysis of Petri Nets Using Symmetries", J. Syst. Anal. Model. Simul., vol. 8, 1991, p. 294-303.