Reachability analysis of (timed) Petri nets using real arithmetic

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

Volumn 1664 LNCS, Issue , 1999, Pages 178-193

  Bérard, Béatrice ^a   Fribourg, Laurent ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DIGITAL ARITHMETIC; ITERATIVE METHODS;

ELIMINATION PROCEDURE; EXACT COMPUTATIONS; INTEGER VARIABLES; PRESBURGER ARITHMETIC; REACHABILITY ANALYSIS; REAL ARITHMETIC; REAL-VALUED VARIABLES; TIMING CONSTRAINTS;

PETRI NETS;

EID: 79952517375     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48320-9_14     Document Type: Conference Paper

References (36)

1. R. Alur, C. Courcoubetis and D. Dill. "Model-Checking in Dense Real-Time". Information and Computation 104:1, 1993, pp. 2-34.
2. R. Alur and D. Dill. "Automata for Modeling Real-Time Systems". ICALP'90, LNCS 443, Springer-Verlag, 1990, pp. 322-335.
3. J. Bengtsson, K.G. Larsen, F. Larsson, P. Pettersson and W. Yi. "UPPAAL - a Tool Suite for Automatic Verification of Real-Time Systems". Hybrid Systems III, LNCS 1066, Springer-Verlag, 1996, pp. 232-243.
4. B. Bérard and L. Fribourg. "Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic". Technical Report LSV-99-3, CNRS & Ecole Normale Supérieure de Cachan, March 1999 (http://www.lsv.ens- cachan.fr/Publis/).
5. G. Berthelot. "Transformations and Decompositions of Nets". Advances in Petri Nets, LNCS 254, Springer-Verlag, 1986, pp. 359-376.
6. B. Berthomieu, M. Diaz. "Modeling and verification of time dependent systems using time Petri nets". IEEE Trans. Softw. Eng. 17:3, 1991, pp. 259-273.
7. B. Boigelot and P. Wolper. "Symbolic Verification with Periodic Sets". CAV'94, LNCS 818, Springer-Verlag, 1994, pp. 55-67.
8. G.W. Brams. Réseaux de Petri: Théorie et Pratique. Masson, Paris, 1983.
9. T. Bultan, R. Gerber and W. Pugh. "Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic". CAV'97, LNCS 1254, 1997, pp. 400-411.
10. F. Chu and X. Xie. "Deadlock Analysis of Petri Nets Using Siphons and Mathematical Programming". To appear in IEEE Trans. on Robotics and Automation.
11. 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". Advances in Petri Nets, LNCS 483, Springer-Verlag, 1990, pp.79-112.
12. H. Comon and Y. Jurski. "Multiple Counters Automata, Safety Analysis and Presburger Arithmetic". CAV'98, LNCS 1427, Springer-Verlag, 1998, pp. 268-279.
13. H. Comon and Y. Jurski. "Timed automata and the theory of real numbers". CAV'99, LNCS, Springer-Verlag, 1999. (This volume)
14. P. Cousot and R. Cousot. "Abstract Interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints". POPL'77, ACM Press, 1977, pp. 238-252.
15. P. Cousot and N. Halbwachs. "Automatic Discovery of Linear Restraints Among Variables of A Program". POPL'78, ACM Press, 1978, pp. 84-97.
16. R. David and H. Alla. Du Grafcet aux Réseaux de Petri, Hermès, Paris, 1989.
17. Delzanno and A. Podelski. "Model-Checking in CLP". TACAS'99, LNCS 1579, Springer-Verlag, 1999, pp. 223-239.
18. J. Esparza and M. Nielsen. "Decidability Issues for Petri Nets - a Survey". EATCS Bulletin 52, 1994.
19. A. Finkel. "The Minimal Coverability Graph for Petri Nets". Advances in Petri Nets. LNCS 674, Springer-Verlag, 1993, pp. 211-243.
20. L. Fribourg and H. Olsén. "Proving safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic". CONCUR'97, LNCS 1243, Springer-Verlag, 1997, pp. 213-227.
21. L. Fribourg and H. Olsén. "A Decompositional Approach for Computing Least Fixed-Points of Datalog Programs with ℤ-counters". Constraints: An International Journal, 2, 1997, pp. 305-335.
22. GIE CB. "Protocole normalisé de connexion au système d'autorisation: spécifications PNCSA Version 2". Document C Communication OSI, 1988.
23. R. Gorrieri and G. Silipandri. "Real-Time System Verification using P/T Nets". CAV'94, LNCS 818, Springer-Verlag, 1994, pp. 14-26.
24. N. Halbwachs. "Delay Analysis in Synchronous Programs". CAV'93, LNCS 697, Springer-Verlag, 1993, pp.333-346.
25. W. Harvey, P.J. Stuckey and A. Borning. "Compiling Constraint Solving Using Projection". CP'97, LNCS 1330, Springer-Verlag, 1997, pp. 491-505.
26. T. Henzinger, P.-H. Ho and H.Wong-Toi. "A user Guide to HyTech". TACAS'95, LNCS 1019, Springer-Verlag, 1995, pp. 41-71.
27. W. Kelly, W. Pugh, E. Rosser and T. Shpeisman. Transitive closure of infinite graphs and its applications. Technical Report CS-TR-3457, UMIACS-TR-95-48, University of Maryland, 1994.
28. P. Merlin and D.J. Farber. "Recoverability of communication protocols". IEEE Trans. on Communications 24:9, Sept. 1976.
29. H. Olsén. Automatic Verification of Petri Nets in a CLP framework. Ph.D Thesis, University of Linköping, Sweden, 1997.
30. W. Pugh. "A practical integer algorithm for exact array dependence analysis". C.ACM 35:8, 1992, pp. 102-114.
31. A. Schrijver, Theory of Linear and Integer Programming, Wiley, 1986.
32. T.R. Shiple, J.H. Kukula and R.K. Ranjan. "A Comparison of Presburger Engines for EFSM Reachability". CAV'98, LNCS 1427, Springer-Verlag, 1998, pp. 280-292.
33. R. Shostack. "Deciding linear inequalities by computing loop residues". J. ACM 28:4, 1981, pp. 769-779.
34. R. Sloan and U. Buy. "Reduction rules for time Petri nets". Acta Informatica 33, 1996, pp. 687-706.
35. P. Wolper and B. Boigelot. "Verifying Systems with Infinite but Regular State Spaces". CAV'98, LNCS 1427, Springer-Verlag, 1998, pp. 88-97.
36. M.C. Zhou, F. Dicesare and A.A. Desrochers. "A Hybrid Methodology for Synthesis of Petri Net Models for Manufacturing Systems". IEEE Trans. on Robotics and Automation 8:3, 1993, pp. 350-361.