Applying cegar to the petri net state equation

Logical Methods in Computer Science

Volumn 8, Issue 3, 2012, Pages

  Wimmel, Harro ^a   Wolf, Karsten ^a  

^a UNIVERSITY OF ROSTOCK   (Germany)

Author keywords

CEGAR; Integer programming; Partial order reduction; Petri net; Reachability problem; Structure analysis

Indexed keywords

INTEGER PROGRAMMING; MODEL CHECKING; PETRI NETS; STATE SPACE METHODS;

CEGAR; COUNTEREXAMPLE-GUIDED ABSTRACTION REFINEMENT; LINEAR-ALGEBRAIC; PARTIAL ORDER REDUCTIONS; REACHABILITY PROBLEM; REACHABILITY QUERIES; STRUCTURE ANALYSIS; VERIFICATION TECHNIQUES;

EQUATIONS OF STATE;

EID: 84990022530     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-8(3:27)2012     Document Type: Article

References (20)

1. 4ti2 team. 4ti2 -A software package for algebraic, geometric and combinatorial problems on linear spaces. http://www.4ti2.de/, 2010.
2. M. Berkelaar, K. Eikland, and P. Notebaert. lp solve Reference Guide. http://lpsolve.sourceforge.net/, 2010.
3. G. Ciardo, R. Marmorstein, and R. Siminiceanu. The saturationalgorithm for symbolic state space exploration. Software Tools for Technology Transfer, 8(1):4-25, 2006.
4. E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In Proc. CAV, 2000.
5. J. Esparza, S.Melzer, and J. Sifakis. Verification ofsafety properties using integer programming: Beyond the state equation. Formal Methods in System Design, 16 (2)(2):159-189, 2000.
6. F. Kordon et al. Report on the model checking contest at Petri nets 2011. To appear in ToPNoC, 2012.
7. H. Garavel. Efficient Petri Net tool for computing quasi-liveness. http://www.informatik.unihamburg. de/cgi-bin/TGI/pnml/getpost?id=2003/07 /2709, 2003.
8. G. Geeraerts, J. F. Raskin, and L. Van Begin. Expand, enlarge and check. http://www.ulb.ac.be/di/ssd/ggeeraer/eec/, 2010.
9. S. R. Kosaraju. Decidability ofreachability in vector addition systems. In Proceedings of the 14th Annual ACM STOC, pages 267-281, 1982.
10. L. M. Kristensen, K. Schmidt, and A. Valmari. Question-guided Stubborn Set Methods for State Properties. Formal Methods in System Design, 29(3):215-251, 2006.
11. J. L. Lambert. A structure to decide reachability in Petri nets. Theoretical Computer Science, 99:79-104, 1992.
12. J. Leroux. The General Vector Addition System Reachability Problem by Presburger Inductive Invariants. In Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, pages 4-13, Los Alamitos, CA, USA, 2009. IEEE Computer Society.
13. R. J. Lipton. The Reachability Problem Requires Exponential Space. Research Report, 62, 1976.
14. E. Mayr. An algorithmfor the general Petri net reachability problem. SIAM Journal of Computing, 13(3):441-460, 1984.
15. K. Schmidt. Stubborn setsfor standard properties. In Applications and Theory of Petri Nets 1999: 20th International Conference, ICATPN’99, Williamsburg, Virginia, USA, June 1999. Proceedings, volume 1639 of Lecture Notes in Computer Science, pages 46-65. Springer-Verlag, June 1999.
16. K. Schmidt. Narrowing Petri net state spaces using the state equation. Fundamenta Informaticae, 47 (3-4):325-335, 2001.
17. C. Talcott and D. Dill. The pathway logic assistant. In Third International Workshop on Computational Methods in Systems Biology, 2005.
18. A. Valmari and Henri Hansen. Can stubborn sets be optimal? In Johan Lilius and Wojciech Penczek, editors, Petri Nets, volume 6128 of Lecture Notes in Computer Science, pages 43-62. Springer, 2010.
19. H. Wimmel. Sara -Structures for Automated Reachability Analysis. http://servicetechnology. org/tools/download, 2010.
20. K. Wolf. Generating Petri net state spaces. In ICATPN 2007, LNCS 4546, pages 29-42. Springer, 2007.