A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Modeling the ADA task system by Petri nets
Computer Languages
Communicating sequential processes
Communicating sequential processes
Interactive State-Space Analysis of Concurrent Systems
IEEE Transactions on Software Engineering
A Petri net framework for automated analysis of Ada tasking behavior
Journal of Systems and Software
Detection of Ada Static Deadlocks Using Petri Net Invariants
IEEE Transactions on Software Engineering
A general-purpose algorithm for analyzing concurrent programs
Communications of the ACM
Task interaction graphs for concurrency analysis
ICSE '89 Proceedings of the 11th international conference on Software engineering
A Protocol Modeling and Verification Approach Based on a Specification Language and Petri Nets
IEEE Transactions on Software Engineering
Compositional reachability analysis using process algebra
TAV4 Proceedings of the symposium on Testing, analysis, and verification
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
An Improved Failures Equivalence for Finite-State Systems with a Reduction Algorithm
Proceedings of the IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XI
Using Truth-Preserving Reductions to Improve the Clarity of Kripke-Models
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
A Stubborn Attack On State Explosion
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Protocol analysis using numerical Petri nets
Advances in Petri Nets 1985, covers the 6th European Workshop on Applications and Theory in Petri Nets-selected papers
IEEE Transactions on Software Engineering
Compositional verification of concurrent systems using Petri-net-based condensation rules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Reduction Methods for Real-Time Systems Using Delay Time Petri Nets
IEEE Transactions on Software Engineering
Control properties in object-oriented specifications
Concurrent object-oriented programming and petri nets
Static Analysis and Dynamic Steering of Time-Dependent Systems
IEEE Transactions on Software Engineering
Hierarchical Reachability Graph Generation for Petri Nets
Formal Methods in System Design
Knowledge-Based Software Architectures: Acquisition, Specification, and Verification
IEEE Transactions on Knowledge and Data Engineering
Compositional Validation of Time-Critical Systems Using Communicating Time Petri Nets
IEEE Transactions on Software Engineering
Models, Formalisms and Methods for Object-Oriented Distributed Computing (ECOOP Workshop)
ECOOP '97 Proceedings of the Workshops on Object-Oriented Technology
Behavior relativity of Petri nets
Journal of Computer Science and Technology
Verifying linear time temporal logic properties of concurrent Ada programs with quasar
Proceedings of the 2003 annual ACM SIGAda international conference on Ada: the engineering of correct and reliable software for real-time & distributed systems using ada and related technologies
Automatic verification for a class of distributed systems
Distributed Computing
State space analysis of Petri nets with relation-algebraic methods
Journal of Symbolic Computation
Static Analysis of Concurrent Programs Using Ordinary Differential Equations
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Petri nets and programming: a survey
ACC'09 Proceedings of the 2009 conference on American Control Conference
Quasar: a new tool for concurrent Ada programs analysis
Ada-Europe'03 Proceedings of the 8th Ada-Europe international conference on Reliable software technologies
Petri nets for protocol engineering
Computer Communications
Formal verification and testing of protocols
Computer Communications
A novel reduction approach for Petri net systems based on matching theory
Expert Systems with Applications: An International Journal
| Hi-index | 0.01 |
Petri nets have been proposed as a promising tool for modeling and analyzing concurrent-software systems such as Ada programs and communication protocol software. Among analysis techniques available for Petri nets, the most general approach is to generate all possible states (markings) of the system in a form of a so-called reachability graph. However, this conventional reachability graph approach is inefficient or intractable, even for a bounded Petri net, due to state explosion in many practical applications. To cope with this problem, this paper proposes a method for constructing a hierarchically organized state space called the hierarchical reachability graph (HRG). Using the HRG, we obtain necessary and sufficient conditions for reachability and deadlock, as well as algorithms to test whether a given state or marking is reachable from the initial state and whether there is a deadlock state (a state with no successor states)