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
Stubborn set methods for process algebras
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Relaxed Visibility Enhances Partial Order Reduction
CAV '97 Proceedings of the 9th 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
On-the-Fly Verification with Stubborn Sets
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)
Journal of Computer and System Sciences
Efficient Controllability Analysis of Open Nets
Web Services and Formal Methods
Analysis on demand: Instantaneous soundness checking of industrial business process models
Data & Knowledge Engineering
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
Multiple representations of biological processes
Transactions on Computational Systems Biology VI
Transforming BPEL to petri nets
BPM'05 Proceedings of the 3rd international conference on Business Process Management
Guaranteeing Weak Termination in Service Discovery
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
Stubborn sets for simple linear time properties
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Narrowing Petri Net State Spaces Using the State Equation
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Stable Models for Stubborn Sets
Fundamenta Informaticae
| Hi-index | 0.00 |
Stubborn sets are a tool for state space reduction preserving certain system properties. We present stubborn set approaches for all popular Petri net standard properties. This extends the list of properties that can be analysed successfully (including boundedness, reversibility). For other properties, our approach can lead to larger reductions (reachability) than previous ones. Furthermore, shortest and chepest witness paths for several properties are now preserved.