Petri nets: an introduction
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Update The Derivation of Conformance Tests From LOTOS Specifications
IEEE Transactions on Software Engineering
Using partial orders for the efficient verification of deadlock freedom and safety properties
Formal Methods in System Design - Special issue on computer-aided verification: special methods II
Communication and Concurrency
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Evaluating Deadlock Detection Methods for Concurrent Software
IEEE Transactions on Software Engineering
Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Partial-Order Methods for Temporal Verification
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Ten Years of Partial Order Reduction
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Proceedings of the 17th International Conference on Application and Theory of Petri Nets
Covering Step Graph Preserving Failure Semantics
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
A Stubborn Attack On State Explosion
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Using Partial Orders to Improve Automatic Verification Methods
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Stubborn sets for reduced state space generation
Proceedings of the 10th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1990
All from One, One for All: on Model Checking Using Representatives
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
Verification of concurrent systems: function and timing
Verification of concurrent systems: function and timing
Covering Steps Graphs of Time Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
On computation complexity of the concurrently enabled transition set problem
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Canonical transition set semantics for petri nets
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Validating time-constrained systems using UML statecharts patterns and timed automata observers
VECoS'09 Proceedings of the Third international conference on Verification and Evaluation of Computer and Communication Systems
Reducing Interleaving Semantics Redundancy in Reachability Analysis of Time Petri Nets
ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Modeling and Verification of Discrete Event Systems
On combining the ready sets with the covering steps methods
International Journal of Critical Computer-Based Systems
| Hi-index | 0.00 |
Concurrent systems are commonly verified after computing a state graph describing all possible behaviors. Unfortunately, this state graph is often too large to be effectively built. Partial-order techniques have been developed to avoid combinatorial explosion while preserving the properties of interest. This paper investigates the combination of two such approaches, persistent sets and covering steps, and proposes partial enumeration algorithms that cumulate their respective benefits.