Optimized colored nets unfolding

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

Volumn 4229 LNCS, Issue , 2006, Pages 339-355

  Kordon, Fabrice ^a   Linard, Alban ^a   Paviot Adet, Emmanuel ^a  

^a SORBONNE UNIVERSITÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; OPTIMIZATION; SEMICONDUCTOR STORAGE; STORAGE ALLOCATION (COMPUTER); PETRI NETS;

DATA DECISION DIAGRAMS; DEAD PARTS; UNFOLDED NETS; COLORED NETS; COLORED PETRI NETS; DATA DECISION; LARGE MODELS; P-INVARIANTS; P/T NET; SYMBOLIC REPRESENTATION;

PETRI NETS; FORMAL METHODS;

EID: 33750573891     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11888116_25     Document Type: Conference Paper

References (12)

1. S. Bernardi, S. Donatelli, and J. Merseguer. From UML sequence diagrams and statecharts to analysable Petri net models. In WOSP '02: Proceedings of the 3rd int. workshop on Software and performance, pages 35-45. ACM Press, 2002.
2. R. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, 35(8):677-691, August 1986.
3. G. Chiola, C. Dutheillet, G. Franceschini, and S. Haddad. On Well-Formed Coloured Nets and their Symbolic Reachability Graph. High-Level Petri Nets. Theory and Application, LNCS, 1991.
4. J-M. Couvreur, E. Encrenaz, E. Paviot-Adet, D. Poitrenaud, and P-A. Wacrenier. Data decision diagrams for petri net analysis. In J. Esparza and C. Lakos, editors, Applications and Theory of Petri Nets 2002, number 2360 in LNCS, pages 101-120. Springer Verlag, June 2002.
5. J-M. Couvreur, S Haddad, and J. F. Peyre. Generative families of positive invariants in coloured nets sub-classes. In G. Rozenberg, editor, Applications and Theory of Petri Nets, LNCS, pages 51-70, 1991.
6. A. de Groot, J. Hooman, F. Kordon, E. Paviot-Adet, I. Vernier-Mounier, M. Lemoine, G. Gaudiere, V. Winter, and D. Kapur. A survey: Applying formal methods to a software intensive system. In 6th International Symposium on High-Assurance Systems Engineering, pages 55-64. IEEE Computer Society, 2001.
7. J. Hugues, Y. Thierry-Mieg, F. Kordon, L. Pautet, S. Baarir, and T. Vergnaud. On the Formal Verification of Middleware Behavioral Properties. In Proceedings of the 9th International Workshop on Formal Methods for Industrial Critical Systems (FMICS'04), volume ENTCS 133, pages 139 - 157. Elsevier, Sept. 2004.
8. K. Jensen. Coloured Petri nets and the invariant-method. Theor. Comput. Sci., 14:317-336, 1981.
9. M. Mäkelä. Optimising enabling tests and unfoldings of algebraic system nets. In Proceedings of the 22nd International Conference on Application and Theory of Petri Nets, number 2075 in LNCS, pages 283 - 302. Springer-Verlag, 2001.
10. Gary L. Peterson. Myths about the mutual exclusion problem. Information Processing Letters, 12(3): 115-116, June 1981.
11. R. Valk. Basic definitions, chapter 4, pages 41-51. Springer Verlag, Petri nets and system engineering (Claude Girault and Rudiger Valk Eds), first edition, 2003.
12. C. Dutheillet Y. Thierry-Mieg and I. Mounier. Automatic Symmetry Detection in Well-Formed Nets. In W. van der Aalst and E. Best, editors, Applications and Theory of Petri Nets 2003: 24th International Conference, ICATPN 2003, Proceedings, number 2679 in LNCS, pages 82-101. Springer Verlag, June 2003.