Checking system properties via integer programming

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

Volumn 1058, Issue , 1996, Pages 250-264

  Melzer, Stephan ^a   Esparza, Javier ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

PETRI NETS;

AUTOMATA MODELS; CASE-STUDIES; SHARED VARIABLES; SYSTEM PROPERTY; VERIFICATION METHOD;

INTEGER PROGRAMMING;

EID: 84947901716     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61055-3_41     Document Type: Conference Paper

References (25)

1. André Arnold. Verification and comparison of transition systems. In M.C. Gaudel and J.P. Jouannaud, editors, TAPSOFT '93: Theory and Practice of Software Development, volume 668 of Lecture Notes in Computer Science, pages 121-135. Springer-Verlag, 1993.
2. G.S. Avrunin, J.C. Corbett, and U.A. Buy. Integer Programming in the Analysis of Concurrent Systems. In K.G. Larsen and A. Skou, editors, Computer Aided Verification, volume 575 of Lecture Notes in Computer Science, pages 92-102, 1991.
3. G.S. Avrunin, U.A. Buy, J.C. Corbett, L.K. Dillon, and J.C. Wileden. Automated Analysis of Concurrent Systems with the Constrained Expression Toolset. IEEE Transactions in Software Engineering, 17(11):1204-1222, 1991.
4. E. Best and H. Fleischhack (eds.). Pep: Programming environment based on nets. Technical report, University of Hildesheim, Germany, 1994.
5. 2-A Basic Petri Net Programming Notation. In Proc. of PARLE-93, volume 694 of Lecture Notes in Computer Science, pages 379-390. Springer-Verlag, 1993 Also: Hildesheimer Informatik Fachbericht 27/92 (1992).
6. G.V. Brams. Réseaux de Petri: Theorie et Practique, Vols. I and II. Masson, 1982.
7. J.C. Corbett. Evaluating Deadlock Detection Methods for Concurrent Software. In T. Ostrand, editor, Proceedings of the 1994 International Symposium on Software Testing and Analysis, pages 204-215, New York, 1994.
8. J.C. Corbett and G.S. Avrunin. Using Integer Programming to Verify general Safety and Liveness properties. Formal Methods in System Design, 6(1):97-123, 1995.
9. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In 5th ACM Symposium on Principles of Programming Languages. ACM-Press, 1978.
10. CPLEX Optimization Inc. Using the CPLEX™ Callable Library and CPLEX™ Mixed Integer Library.
11. J. Desel and J. Esparza. Free-choice Petri Nets, volume 40 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1995.
12. J. Esparza and M. Silva. A Polynomial-Time Algorithm to Prove Liveness of Bounded Free Choice Nets. Theoretical Computer Science, 102:185-205, 1992.
13. J. Ezpeleta, J.M. Couvreur, and M. Silva. A New Technique for Finding a Generating Family of Siphons, Traps and ST-Components. Application to Colored Petri Nets. In G. Rozenberg, editor, Advances in Petri Nets, volume 674 of Lecture Notes in Computer Science, pages 126-147. Springer Verlag, 1993.
14. B. Grahlmann. Verifying telecommunication protocols with pep (draft). Technical report, University of Hildesheim, Germany, 1995.
15. N. Halbwachs. About synchronous programming and abstract interpretation. In B. Le Charlier, editor, SAS '94: Static Analysis Symposium, volume 864 of Lecture Notes in Computer Science, pages 179-192. Springer-Verlag, 1994.
16. Stephan Kleuker. A gentle introduction to specification engineering using a case study in telecommunications. In P.D. Mosses, M. Nielsen, and M.I. Schwartzbach, editors, TAPSOFT '95, volume 915 of Lecture Notes in Computer Science. Springer-Verlag, 1995.
17. K. Lautenbach. Linear algebraic calculation of deadlocks and traps. In H.J. Genrich K. Voss and G. Rozenberg, editors, Concurrency and Nets, pages 315-336. Springer-Verlag, 1987.
18. K. Lautenbach. Linear Algebraic Techniques for Place/Transition Nets. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri Nets: Central Models and Their Properties, Advance in Petri Nets 1986, volume 254 of Lecture Notes in Computer Science, pages 142-167. Springer-Verlag, 1987.
19. G. Memmi and G. Roucairol. Linear Algebra in Net Theory. In W. Brauer, editor, Net Theory and Applications, volume 84 of Lecture Notes in Computer Science, pages 213-223. Springer-Verlag, 1980.
20. Tadao Murata. Petri nets: Properties, analysis and applications. Proc. of the IEEE, 77(4):541-580, 1989.
21. Enric Pastor, Oriol Roig, Jordi Cortadella, and Rosa M. Badia. Petri net analysis using boolean manipulation. In Robert Valette, editor, Application and Theory of Petri Nets 1994, volume 815 of Lecture Notes in Computer Science, pages 416-435. Springer-Verlag, 1994.
22. CCITT Recommendations Q. 1200. Intelligent networks, final version. Technical report, 1992.
23. M. Raynal. Algorithms for Mutual Exclusion. North Oxford Academic, 1986.
24. W. Reisig. Petri Nets, volume 4 of EATCS Monographs on Theoretical Computer Science. Springer Verlag, 1985.
25. A. Schrijver. Theory of Linear and Integer Programing. Series in Discrete Mathematics. Wiley, 1986.