Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
A stubborn attack on state explosion
Formal Methods in System Design - Special issue on computer-aided verification: special methods I
A partial approach to model checking
Papers presented at the IEEE symposium on Logic in computer science
Stubborn set methods for process algebras
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Elements of distributed algorithms: modeling and analysis with Petri nets
Elements of distributed algorithms: modeling and analysis with Petri nets
Stubborn sets for model checking the EF/AG fragment of CTL
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Bounded Model Checking Using Satisfiability Solving
Formal Methods in System Design
Relaxed Visibility Enhances Partial Order Reduction
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Stubborn Sets for Standard Properties
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
All from One, One for All: on Model Checking Using Representatives
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
A partial order approach to branching time logic model checking
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Hazard Detection in a GALS Wrapper: A Case Study
ACSD '05 Proceedings of the Fifth International Conference on Application of Concurrency to System Design
Exploring the Scope for Partial Order Reduction
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Improved question-guided stubborn set methods for state properties
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Generating Petri net state spaces
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Analysis on demand: Instantaneous soundness checking of industrial business process models
Data & Knowledge Engineering
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
A counterexample-based incremental and modular verification approach
Proceedings of the 17th Monterey conference on Large-Scale Complex IT Systems: development, operation and management
A Sweep-Line Method for Büchi Automata-based Model Checking
Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012
| Hi-index | 0.00 |
We call a linear time property simple if counterexamples are accepted by a Büchi automaton that has only singleton strongly connected components. This class contains interesting properties such as LTL formulas $G(\varphi \implies F \psi)$ or ϕU ψ which have not yet received support beyond general LTL preserving approaches. We contribute a stubborn set approach to simple properties with the following ingredients. First, we decompose the verification problem into finitely many simpler problems that can be independently executed. Second, we propose a stubborn set method for the resulting problems that does neither require cycle detection, nor stuttering invariance, nor existence of transitions that are invisible to all atomic propositions. This means that our approach is applicable in cases where traditional approaches fail. Third, we show that sufficient potential is left in existing implementations of the proposed conditions by exploiting all the available nondeterminism in these procedures. We employ a translation to integer linear programming (ILP) for supporting this claim.