Petri nets: an introduction
The mathematics of Petri nets
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
A stubborn attack on state explosion
Formal Methods in System Design - Special issue on computer-aided verification: special methods I
Stubborn Sets for Real-Time Petri Nets
Formal Methods in System Design
Efficient Verification of Parallel Real–Time Systems
Formal Methods in System Design - Special issue on computer aided verification (CAV 93)
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
A partial order approach to branching time logic model checking
Information and Computation
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Improving partial order reductions for universal branching time properties
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Stubborn sets for model checking the EF/AG fragment of CTL
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Stable models for stubborn sets
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Partial-Order Reduction in the Weak Modal Mu-Calculus
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Relaxed Visibility Enhances Partial Order Reduction
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Proceedings of the 17th International Conference on Application and Theory of Petri Nets
Using Optimal Simulations to Reduce Reachability Graphs
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Compositional Model Checking for Linear-Time Temporal Logic
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
All from One, One for All: on Model Checking Using Representatives
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
On-the-Fly Verification with Stubborn Sets
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Analysis of Petri Nets with a Dynamic Priority Method
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Verification of concurrent systems: function and timing
Verification of concurrent systems: function and timing
Formal design and verification methods for shared memory systems
Formal design and verification methods for shared memory systems
Verification of distributed programs using representative interleaving sequences
Distributed Computing
Improved question-guided stubborn set methods for state properties
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
| Hi-index | 0.00 |
The stubborn set method is one of the methods that try to relieve the state space explosion problem that occurs in state space generation. This article is concentrated on the verification of next-time-less LTL (linear time temporal logic) formulas with the aid of the stubborn set method. The essential contribution is a theorem that gives us a way to utilize the structure of the checked formula when the stubborn set method is used and there is no fairness assumption. The theorem also applies to verification under fairness assumptions, including those which allow a predefined subset of actions to be treated unfairly.