Stubborn sets for reduced state generation
APN 90 Proceedings on Advances in Petri nets 1990
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
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
A General Approach to Partial Order Reductions in Symbolic Verification (Extended Abstract)
CAV '98 Proceedings of the 10th International Conference 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
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)
Improved question-guided stubborn set methods for state properties
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Applying CEGAR to the petri net state equation
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
| Hi-index | 0.00 |
Given a (possibly partially defined) state, all count vectors of transition sequences reaching that state are solutions to a corresponding Petri net state equation. We propose a search strategy where sequences corresponding to a minimal solution of the state equation are explored first. Then step by step the search space is relaxed to arbitrary count vectors. This heuristics relies on the observation that in many (though provably not in all) cases, minimal solutions of the state equation can be realized as a firing sequence. If no target state is reachable, either the state equation does not have solutions, or our search method would yield the full state space. We study the impact of the state equation on reachability, present an algorithm that exploits information from the state equation and discuss its application in stateless search as well as its combination with stubborn set reduction.