New efficient Petri nets reductions for parallel programs verification

Parallel Processing Letters

Volumn 16, Issue 1, 2006, Pages 101-116

  Haddad, Serge ^a   Pradat Peyre, Jean François ^b  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b Bioinformatique et Chimie Moléculaire   (France)

Author keywords

Concurrent software verification; Petri nets; Reduction theory; Structural abstraction

Indexed keywords

COMPUTATIONAL COMPLEXITY; INTERNET; LINEAR ALGEBRA; PETRI NETS;

CONCURRENT SOFTWARE VERIFICATION; REDUCTION THEORY; STRUCTURAL ABSTRACTION;

PARALLEL PROCESSING SYSTEMS;

EID: 33645216123     PISSN: 01296264     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129626406002502     Document Type: Article

References (18)

1. [Ber83] G. Berthelot. Transformation et analyse de réseaux de Petri, applications aux protocoles. Thèse d'état, Université Pierre et Marie Curie, Paris, 1983.
2. [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.
3. [Ber86] G. Berthelot. Transformations and decompositions of nets. In Advances in Petri Nets, number 254 in LNCS, pages 359-376. Springer-Verlag, 1986.
4. [CGL94] Edmund M. Clarke, Orna Grumberg, and David E. Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 16(5):1512-1542, September 1994.
5. [CL98] Ernie Cohen and Leslie Lamport. Reduction in TLA. In International Conference on Concurrency Theory, pages 317-331, 1998.
6. [CS91] J. M. Colom and M. Silva. Convex geometry and semiflows in P/T nets. A comparative study of algorithms for computation of minimal P-semiflows. LNCS; Advances in Petri Nets 1990, 483:79-112, 1991. NewsletterInfo: 33, 39.
7. [Doe77] Thomas W. Doeppner, Jr. Parallel program correctness through refinement. In Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pages 155-169. ACM Press, 1977.
8. [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.
9. [ES01] 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, volume 2144 of LNCS, pages 310-324. Springer-Verlag, 2001.
10. [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.
11. [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.
12. [FQ03c] Stephen N. Freund and Shaz Qadeer. Checking concise specifications for multi-threaded software. In Formal Techniques for Java-like Programs, 2003.
13. [Gri96] E. Pascal Gribomon. Atomicity refinement and trace reduction theorems. In Rajeev Alur and Thomas A. Henzinger, editors, CAV, volume 1102, pages 311-322, New Brunswick, NJ, USA, / 1996. Springer Verlag.
14. [Hab69] A. N. Habermann. Prevention of system deadlocks. ACM, 12(7):373-ff., 1969.
15. [HPP04] S. Haddad and J.F. Pradat-Peyre. Efficient reductions for LTL formulae verification. Technical Report 634, CEDRIC, CNAM, Paris, http://cedric.cnam.fr, 2004.
16. [Lip75] Richard J. Lipton. Reduction: a method of proving properties of parallel programs. Commun. ACM, 18(12):717-721, 1975.
17. [LS89] Leslie Lamport and Fred B. Schneider. Pretending atomicity. Technical Report TR89-1005, 1989.
18. [PPP00] D. Poitrenaud 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.