Petri net analysis using invariant generation

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

Volumn 2772, Issue , 2004, Pages 682-701

  Sankaranarayanan, Sriram ^a   Sipma, Henny ^a   Manna, Zohar ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONCURRENT SYSTEMS; DEADLOCK FREEDOM; INDUCTIVE LINEAR INVARIANTS; INVARIANT GENERATIONS; REACHABILITY; SPECIAL STRUCTURE; TRANSITION SYSTEM; WIDE SPREADS;

PETRI NETS;

EID: 35248889542     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (16)

1. B. Bérard and L. Fribourg. Reachability analysis of (timed) petri nets using real arithmetic. In Proc. Intl. Conf. Concurrency Theory (CONCUR'99), volume 1664 of LNCS, 1999.
2. F. Besson, T. Jensen, and J.-P. Talpin. Polyhedral analysis of synchronous languages. In Static Analysis Symposium, SAS'99, Lecture Notes in Computer Science 1694, pages 51-69, 1999.
3. A. Bockmayr and V. Weispfenning. Solving numerical constraints. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume I, chapter 12, pages 751-842. Elsevier Science, 2001.
4. F. Chu and X.-L. Xie. Deadlock analysis of petri nets using siphons and mathematical programming. IEEE Transactions on Robotics and Automation, 13(6):793-804, December 1997.
5. M. Colón, S. Sankaranarayanan, and H. Sipma. Linear invariant generation using non-linear constraint solving. In Computer Aided Verification (CAV), Lecture Notes in Computer Science 2725, pages 420-432, 2003.
6. P. Cousot and R. Cousot. Abstract Interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In ACM Principles of Programming Languages, pages 238-252, 1977.
7. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among the variables of a program. In ACM Principles of Programming Languages, pages 84-97, Jan. 1978.
8. L. Fribourg and H. Olsén. Proving safety properties of infinite state systems by compilation into presburger arithmetic. In Proceedings of CONCUR'97, LNCS, volume 1243, pages 213-227, Germany, Berlin, 1997.
9. N. Halbwachs and Y.-E. Proy. POLyhedra desK cAlculator (POLKA). VERIMAG, Montbonnot, France, Sept. 1995.
10. T. A. Henzinger and P. Ho. HYTECH: The Cornell hybrid technology tool. In Hybrid Systems II, volume 999 of LNCS, pages 265-293, 1995.
11. Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.
12. T. Murata. Petri nets: Properties, analysis and applications. Proceedings of the IEEE, 77(4):541-580, Apr. 1989.
13. J. Peterson. Petri Net Theory and the Modelling of Systems. Prentice Hall, 1983.
14. A. Schrijver. Theory of Linear and Integer Programming. Wiley, 1986.
15. M. Silva, E. Teruel, and J. M. Colom. Linear algebraic and linear programming techniques for the analysis of place/transition net systems. Lectures on Petri Nets I: Basic Models, LNCS, 1491:309-373, 1998.
16. M. Zhou, F. DiCesare, and A. A. Desrochers. A hybrid methodology for synthesis of petri net models for manufacturing systems. IEEE Transactions on Robotics and Automation, 8(3):350-361, June 1992.