Automated Generation of a Progress Measure for the Sweep-Line Method

作者: Karsten Schmidt

DOI: 10.1007/978-3-540-24730-2_17

关键词:

摘要: In the context of Petri nets, we propose an automated construction a progress measure which is important pre-requisite for state space reduction technique called sweep-line method. Our based on linear-algebraic considerations concerning transition vectors net under consideration.

参考文章(20)
Antti Valmari, Stubborn set methods for process algebras POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification. pp. 213- 231 ,(1997)
Karsten Schmidt, Integrating Low Level Symmetries into Reachability Analysis tools and algorithms for construction and analysis of systems. pp. 315- 330 ,(2000) , 10.1007/3-540-46419-0_22
Karsten Schmidt, LoLA A Low Level Analyser Lecture Notes in Computer Science. pp. 465- 474 ,(2000) , 10.1007/3-540-44988-4_27
Doron Peled, All from One, One for All: on Model Checking Using Representatives computer aided verification. pp. 409- 423 ,(1993) , 10.1007/3-540-56922-7_34
Søren Christensen, Lars Michael Kristensen, Thomas Mailund, A Sweep-Line Method for State Space Exploration tools and algorithms for construction and analysis of systems. pp. 450- 464 ,(2001) , 10.1007/3-540-45319-9_31
Karsteb Schmidt, None, Stubborn Sets for Standard Properties applications and theory of petri nets. pp. 46- 65 ,(1999) , 10.1007/3-540-48745-X_4
Lars Michael Kristensen, Antti Valmari, Improved Question-Guided Stubborn Set Methods for State Properties Lecture Notes in Computer Science. pp. 282- 302 ,(2000) , 10.1007/3-540-44988-4_17
Lars Michael Kristensen, Thomas Mailund, A Generalised Sweep-Line Method for Safety Properties FME 2002:Formal Methods—Getting IT Right. pp. 549- 567 ,(2002) , 10.1007/3-540-45614-7_31
Peter Huber, Arne M. Jensen, Leif O. Jepsen, Kurt Jensen, Towards reachability trees for high-level Petri nets applications and theory of petri nets. pp. 215- 233 ,(1985) , 10.1007/3-540-15204-0_13
C. Norris IP, David L. Dill, Better Verification Through Symmetry formal methods. ,vol. 9, pp. 41- 75 ,(1996) , 10.1007/BF00625968