Syntactical colored petri nets reductions

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

Volumn 3707 LNCS, Issue , 2005, Pages 202-216

  Evangelista, S ^a   Haddad, S ^b   Pradat Peyre, J F ^a  

^a University of Paris Cité   (France)

^b UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIZATION; COLOR MAPPINGS; HIGH-LEVEL PETRI NETS;

ALGEBRA; MATHEMATICAL MODELS; SYNCHRONIZATION; SYNTACTICS;

PETRI NETS;

EID: 33646203434     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11562948_17     Document Type: Conference Paper

References (18)

1. [Ber85] G. Berthelot. Checking properties of nets using transformations. In G. Rozenberg, editor, Advances in Petri nets, volume No. 222 of LNCS. Springer-Verlag, 1985.
2. [BRV80] G. Berthelot, G. Roucairol, and R. Valk. Reduction of nets and parallel programs. In Brauer, W., editor, LNCS: Net Theory and Applications, volume 84, pages 277-290, Berlin, Heidelberg, New York, 1980. Springer-Verlag.
3. [CL98] Ernie Cohen and Leslie Lamport. Reduction in TLA. In International Conference on Concurrency Theory, pages 317-331, 1998.
4. [EHPP04] S. Evangelista, S. Haddad, and J.F. Pradat-Peyre. Colored Petri nets reductions for concurrent software validation. Technical report, CEDRIC, CNAM, Paris, 2004.
5. [EKPPR03] S. Evangelista, C. Kaiser, J. F. Pradat-Peyre, and P. Rousseau. Quasar: a new tool for analysing concurrent programs. In Reliable Software. Technologies - Ada- Europe 2003, volume 2655 of LNCS. Springer-Verlag, 2003.
6. [IES01] J. Esparza and C. Schröter. Net Reductions for LTL Model-Checking. In T. Margaria and T. Melham, editors, Correct Hardware Design and Verification Methods (CHARME'01), volume 2144 of Lecture Notes in Computer Science, pages 310-324. Springer-Verlag, 2001.
7. [Eva04] S. Evangelista. Syntactical rules for colored Petri nets manipulation. Technical Report 641, CEDRIC, CNAM, Paris, 2004.
8. [FQ03a] Cormac Flanagan and Shaz Qadeer. Transactions for software model checking. In Byron Cook, Scott Stoller, and Willem Visser, editors, Electronic Notes in Theoretical Computer Science, volume 89. Elsevier, 2003.
9. [FQ03b] Cormac Flanagan and Shaz Qadeer, A type and effect system for atomicity. In Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation, pages 338-349. ACM Press, 2003.
10. [GW93] Patrice Godefroid and Pierre Wolper. Using partial orders for the efficient verification of deadlock freedom and safety properties. Form. Methods Syst., 2(2):149-164, 1993.
11. [Had90] S. Haddad. A reduction theory for colored nets. In Jensen and Rozenberg, editors, High-level Petri Nets, Theory and Application, volume 424 of LNCS, pages 399-425. Springer-Verlag, 1990.
12. [HPP04] S. Haddad and J.F. Pradat-Peyre. Efficient reductions for LTL formulae verification. Technical report, CEDRIC, CNAM, Paris, 2004.
13. [Lip75] Richard J. Lipton. Reduction: a method of proving properties of parallel programs. Commun. ACM, 18(12):717-721, 1975.
14. [PPP00] D. Poilrenaud and J.F. Pradat-Peyre. Pre and post-agglomerations for LTL model checking. In M. Nielsen and D Simpson, editors, High-level Petri Nets, Theory and Application, number 1825 in LNCS, pages 387-408. Springer-Verlag, 2000.
15. [SC03] Scotl D. Stoller and Ernie Cohen. Optimistic synchronization-based state-space reduction. In H. Garavel and J. Hatcliff, editors, TACAS'03, volume 2619 of Lecture Notes in Computer Science, pages 489-504. Springer-Verlag, April 2003.
16. [SS00] P. Schnoebelen and N. Sidorova. Bisimulation and the reduction of petri nets. In M. Nielsen and D Simpson, editors, High-level Petri Nets, Theory and Application, number 1825 in LNCS, pages 409-423. Springer-Verlag, 2000.
17. [Va193] Antti Valmari. On-the-fly verification with stubborn sets. In Proceedings of the 5th International Conference on Computer Aided Verification, pages 397-408. Springer-Verlag, 1993.
18. [VM97] François Vernadat and François Michel. Covering step graph preserving failure semantics. In Proceedings of the 18th International Conference on Application and Theory of Petri Nets, pages 253-270. Springer-Verlag, 1997.