Petri nets: an introduction
Fairness
Handbook of theoretical computer science (vol. B)
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
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
Using asynchronous Büchi automata for efficient automatic verification of concurrent systems
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
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
Refining Dependencies Improves Partial-Order Verification Methods (Extended Abstract)
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Efficient Verification of Parallel Real-Time Systems
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
On Combining the Stubborn Set Method with the Sleep Set Method
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Analysis of Petri Nets with a Dynamic Priority Method
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
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)
Verification of concurrent systems: function and timing
Verification of concurrent systems: function and timing
Verification of distributed programs using representative interleaving sequences
Distributed Computing
| 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 paper is concentrated on the verification of nexttime-less LTL (linear time temporal logic) formulas with the aid of the stubborn set method. The contribution of the paper is a theorem that gives us a way to utilize the structure of the formula when the stubborn set method is used and there is no fairness assumption. Connections to already known results are drawn by modifying the theorem to concern verification under fairness assumptions.