Modular state space exploration for timed petri nets

International Journal on Software Tools for Technology Transfer

Volumn 9, Issue 3-4, 2007, Pages 393-411

  Lakos, Charles ^a   Petrucci, L ^b  

^a UNIVERSITY OF ADELAIDE   (Australia)

^b Laboratoire d'Informatique de Paris Nord Villetaneuse   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DISCRETE EVENT SIMULATION; OPTIMIZATION; PARALLEL ALGORITHMS; PETRI NETS; STATE SPACE METHODS;

CONCURRENT SYSTEMS; MODULAR STATE SPACE EXPLORATION; TIMED PETRI NETS; TIMED SYSTEMS; UNIPROCESSOR ALGORITHMS;

CONCURRENT ENGINEERING;

EID: 34249914818     PISSN: 14332779     EISSN: 14332787     Source Type: Journal    
DOI: 10.1007/s10009-007-0033-2     Document Type: Article

References (16)

1. Aalst W. (1993). Interval Timed Coloured Petri Nets and their analysis. In: Marsan, M.A. (eds) Internation Conference on the Application and Theory of Petri Nets, vol. 961 of LNCS., pp 453-472. Springer, Chicago
2. Berthelot G., Boucheneb H. (1994). Occurrence graphs for Interval Timed Coloured Nets. In: Proceedings of 15th International Conference Application and Theory of Petri Nets (ICATPN'1994), Zaragoza, Spain, June 1994, vol. 815 of LNCS, pp 79-98. Springer, Berlin
3. Boucheneb, H., Bertholet, G.: Towards a simplified building of Time Petri Nets reachability graph. In: 5th International Workshop on Petri Nets and Performance Models, pp 46-55. Springer, Berlin (1993)
4. Christensen S. and Petrucci L. (2000). Modular analysis of Petri Nets. Comput. J. 43(3): 224-242
5. Design/CPN online. http://www.daimi.au.dk/designCPN
6. Fujimoto R.M. (1990). Parallel discrete event simulation. Commun. ACM 33(10): 30-53
7. Jensen K. (1992). Coloured Petri Nets: Basic concepts, analysis methods and practical use, vol. 1: Basic Concepts. Monographs in Theoretical Computer Science. Springer, Berlin
8. Jensen K. (1994). Coloured Petri Nets: Basic concepts, analysis methods and practical use. vol. 2: Analysis Methods. Monographs in Theoretical Computer Science. Springer, Berlin
9. Kristensen, L., Petrucci, L.: An approach to distributed state space exploration for Coloured Petri Nets. In: Proceedings of 25th International Conference Application and Theory of Petri Nets (ICATPN'2004), Bologna, Italy, June 2004, vol. 3099 of LNCS, pp 474-483. Springer, Berlin (2004)
10. Lakos, C., Petrucci, L.: Modular analysis of systems composed of semiautonomous subsystems. In: Proceedings of 4th International Conference on Application of Concurrency to System Design (ACSD'04), Hamilton, Canada, June 2004, pp 185-194. IEEE Comp. Soc. Press (2004)
11. Lewis, G.A.: Incremental specification and analysis in the context of Coloured Petri Nets. Ph.D., Department of Computing, University of Tasmania, 2002
12. Mäkelä M. (2002). Model checking safety properties in Modular High-level Nets. In: Best, E. (eds) 24th International Conference on the Application and Theory of Petri Nets, Eindhoven, The Netherlands vol. 2679 of LNCS., pp 201-220. Springer, Berlin
13. Mäkelä, M.: Maria - Modular reachability analyzer for Algebraic System Nets (Version 1.3.4). Technical report, Helsinki University of Technology, Laboratory for Theoretical Computer Science, June 2003
14. Penczek W. and Polrola A. (2004). Specification and model checking of temporal properties in Time Petri Nets and Timed Automata. In: Cortadella, J. and Reisig, W. (eds) International Conference on the Application and Theory of Petri Nets, vol 3099 of Lecture Notes in Computer Science, Florida., pp 37-76. Springer, Berlin
15. Petrucci, L.: CEver picture story: experiments with modular state spaces. Petri Net Newslett. 68:COver page and 5-10, April 2005
16. Virbitskaite I. and Pokozy E. (1999). A partial order method for the verification of Time Petri Nets. In: Ciobanu, G. and Paun, G. (eds) Fundamentals of Computation Theory, vol. 1684 of Lecture Notes in Computer Science., pp 547-558. Springer, Berlin