Automated generation of a progress measure for the sweep-line method

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

Volumn 2988, Issue , 2004, Pages 192-204

  Schmidt, Karsten ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

AUTOMATED CONSTRUCTION; AUTOMATED GENERATION; LINEAR-ALGEBRAIC; PRE-REQUISITES; STATE-SPACE REDUCTION; SWEEP LINES; TRANSITION VECTORS;

PETRI NETS;

EID: 21144439688     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24730-2_17     Document Type: Article

References (20)

1. [CEFJ96] E.M. Clarke, R. Enders, T. Filkorn, and S. Jha. Exploiting symmetry in temporal logic model checking. Formal Methods in System Design 9, pages 77-104, 1996.
2. [CKM01] S. Christensen, L.M. Kristensen, and T. Mailund. A sweep-line method for state space exploration. Proc. TACAS 01, LNCS, 2031:450-464, 2001.
3. [ES96] E.A. Emerson and A.P. Sistla. Symmetry and model checking. Formal Methods in System Design 9, pages 105-131, 1996.
4. [GW91] P. Godefroid and P. Wolper. A partial approach to model checking. 6th IEEE Symp. on Logic in Computer Science, Amsterdam, pages 406-415, 1991.
5. [HJJJ84] Huber, A. Jensen, Jepsen, and K. Jensen. Towards reachability trees for high-level petri nets. In Advances in Petri Nets 1984, Lecture Notes on Computer Science 188, pages 215-233, 1984.
6. [ID96] C.N. Ip and D.L. Dill. Better verification through symmetry. Formal Methods in System Design 9, pages 41-75, 1996.
7. [KM02] L.M. Kristensen and T. Mailund. A generalized sweep-line method for safety properties. Proc. FME 02, LNCS, 2391:549-567, 2002.
8. [KV00] L.M. Krisensen and A. Valmari. Improved question-guided stubborn set methods for state properties. Proc. 21th Int. Conf. Application and Theory of Petri nets, pages 282-302, 2000.
9. [Mai03] T. Mailund. Sweeping the state space. PhD thesis, Univerity of Aarhus, 2003.
10. [Pel93] D. Peled. All from one, one for all: on model-checking using representitives. 5th Int. Conf. Computer Aided Verification, Elounda, Greece, LNCS 697, pages 409-423, 1993.
11. [Sch99a] K. Schmidt. Lola: A low level analyser. Proc. Int. Conf. Application and Theory of Petri net, LNCS, 1825:465-474, 1999.
12. [Sch99b] K. Schmidt. Stubborn set for standard properties. Proc. 20th Int. Conf. Application and Theory of Petri nets, LNCS 1639, pages 46-65, 1999.
13. [Sch00a] K. Schmidt. How to calculate symmetries of petri nets. Acta Informatica 36, pages 545-590, 2000.
14. [Sch00b] K. Schmidt. Integrating low level symmetries into reachability analysis. Proc. 6th Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems, LNCS 1785, pages 315-331, 2000.
15. [Tar72] R. E. Tarjan. Depth first search and linear graph algorithms. SIAM J. Comput, 1:146-160, 1972.
16. [Val88] A. Valmari. Error detection by reduced reachability graph generation. Proc. of the 9th European Workshop on Application and Theory of Petri Nets, Venice, 1988.
17. [Val91] A. Valmari. Stubborn sets for reduced state space generation. Advances of Petri Nets 1990, LNCS 483, pages 491-511, 1991.
18. [Val93] A. Valmari. On-the-fly verification with stubborn sets. 5th Int. Conf. Computer Aided Verification,Elounda, Greece, LNCS 697, pages 397-408, 1993.
19. [Val96] A. Valmari. Stubborn set methods for process algebras. Workshop on Partial Order Methods in Verification, Princeton, pages 192-210, 1996.
20. [Val98] A. Valmari. The state explosion problem. Lectures on Petri nets I: Basic models, LNCS 1491, pages 429-528, 1998.