Efficient state-based analysis by introducing bags in petri nets color doiDains

Proceedings of the American Control Conference

Volumn , Issue , 2009, Pages 5018-5025

  Haddad, Serge ^a   Kordon, Fabrice ^b   Petrucci, Laure ^c   Pradat Peyre, Jean Fransois ^b   Treves, Nicolas ^d  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^c LIPN   (France)

^d University of Paris Cité   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS CAPABILITIES; COLOURED PETRI NETS; CONTROLLABLE SYSTEMS; DEADLOCK DETECTION; FLEXIBLE MODEL; HIGH-LEVEL NETS; NET MODEL; SAFETY PROPERTY; SIMPLE TYPES; STATE SPACE; STATE-BASED; STRUCTURED SPECIFICATION; SYMBOLIC REACHABILITY; SYMMETRIC NETS;

GRAPH THEORY;

PETRI NETS;

EID: 70449629506     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACC.2009.5160020     Document Type: Conference Paper

References (19)

1. K. Jensen, "Coloured Petri nets and the invariant-method:" Theor. Comput. Sci., vol. 14. pp. 317-336. 1981.
2. M. Beaudouin-Lafon. W. Mackay. M. Jensen. P. Andersen. P. Janecek. H. Lassen. K. Lund. K. Monensen. S. Munck. A. Ratzer. K. Ravn. S. Christensen. and K. Jensen. "CPNTools: A Tool for Editing and Simulating Coloured Petri Nets ETAPS Tool Demonstration Related to TACAS;" in Tools and Algorithms for the Construction and Analysis of Systems.7th International Conference. TACAS 2001, L. Springer Vcrlaglag,Ed., vol. 2031. 2001 pp. 574-577.
3. K. Jensen. L. Kristensen. and L. Wells, "Coloured Petri Ncts and CPN Tools for modelling and validation of concurrent systems:" STTT. vol. 9. no. 3-4. pp. 213-254. 2007.
4. W. Reisig. "Petri nets and algebraic specifications:" Theoretical Computer Science, vol. 80. pp. 1-34. 1991. newsletterInfo: 3839.
5. H. Genrich and K. Lautenbach. "System modeling with high-level Petri-nets:" in Theoretical Computer Science. no, 13. 1981. pp. 103-136.
6. L. Hillah. F. Kordon. L. Petrucci. and N. Tr̀eves. "PN standardisation : a survey:" in International Conference on Formal Methods for Networked and Distributed Systems (FORTE'06), vol. 4229. Paris. France: Springer Verlag, LNCS, September 2006, pp. 307-322.
7. G. Chiola. C. Duthcillet. G. Franceschinis. and S. Haddad. "Stochastic well-fonned colored nets and symmetric modeling applications:" IEEE Traflsactions 0n Computers, vol. 42. no. II. pp. 1343-1360. 1993. [Online]. Available: citeseer.ist.psu.edu/chiola93stochastic. html
8. -, "A symbolic reachability graph for coloured Petri nets:" Theoretical Computer Science, v0l. 176, no. 1-2. pp. 39-65. 1997.
9. H. Klauck. "Algorithms for parity games:" in Automata, Logics, and Infinite Games,. sera LNCS. vol. 2500. Springer. 2002. pp. 107-129.
10. A. de Groot, J. Hooman, F. Kordon, E. Paviot-Adet, I. Vemier-Mounier, M. Lemoine, G. Gaudiere, V. Winter, and D. Kapur, "A survey: Applying formal mcthods to a software intcnsivc system:" in 6th International Symposium 0n High-Assurance Systems Engineering. IEEE Computer Societys 2001, pp. 55-64.
11. F. Bonncfoi, L. Hillah, F. Kordon, and G. Frémont, "An approach to model variations of a scenario: Application to Intelligent Transpon Systems:" in Workshop Oil Modelling of Objects, Components, and Agents (MOCA'06), Turku, Finland, June 2006.
12. P. Huber, A. M. Jensen, L. o. Jepsen, and K. Jensen, "Reachability trees for high-level petri nets:" Theoretical Computer Science, Vol 45. no. 3, pp. 261-292. 1986. newsletterlnfo: 27.
13. T. Junttilu. "On the symmetry reduction method for petri nets and similar fonnalisms:" Ph.D. dissertation, Helsinki University of Technology. Espoo, Finland. 2003.
14. F. A. Emerson and A. P. Sistla. "Symmetry and model checking:" Formal Methods in System Design: An Internatiol Journal,. vol. 9. no. 112. pp. 105-131. August 1996. [Online). Available: citeseer.ist .psu.edu/emerson94symmetry.html
15. K. Schmidt. "How to calculate symmetries of petri nets:" Acta Inf., vol. 36. no. 7. pp. 545-590. 2000.
16. E. A. Emerson and R. J. Trefler. "From asymmetry to full symmetry: New techniques for symmetry reduction in model checking:" in CHARME, ser. Lecture Notes in Computer Science, vol. 1703. Springer, 1999. pp. 142-156.
17. S. Baarir, C. Dutheillet, S. Haddad, and J.-M. Ilíe. "On the use of exact lumpability in partially symmetricalwell-formed nets:" in QEST. IEEE Computer Society. 2005. pp. 23-32.
18. S. Haddad, F. Kordon, L. Petrucci, J.-F. Pradat-Peyre, and N. Treves, "Efficient State-Based Analysis by Introducing Bags in Petri Nets Color Domains:" LSV. École Nonnal Suṕerieure de Cachan, Tech. Rep. RR LSV 09-07. March 2009.
19. th International Conference on Application of Concurrency to System Design (ACSD'06). Turku, Finland: IEEE Computer Society. June 2006. pp. 273-275.