Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Reduction and covering of infinite reachability trees
Information and Computation
Finite transition systems: semantics of communicating systems
Finite transition systems: semantics of communicating systems
Transition systems, event structures, and unfoldings
Information and Computation
A technique of state space search based on unfolding
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Algorithmic analysis of programs with well quasi-ordered domains
Information and Computation - Special issue: LICS 1996—Part 1
Well-structured transition systems everywhere!
Theoretical Computer Science
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
An Improvement of McMillan's Unfolding Algorithm
Formal Methods in System Design
A General Approach to Partial Order Reductions in Symbolic Verification (Extended Abstract)
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Unfoldings of Unbounded Petri Nets
CAV '00 Proceedings of the 12th International Conference 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
Branching processes of high-level Petri nets
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
An approach to unfolding asynchronous communication protocols
FM'05 Proceedings of the 2005 international conference on Formal Methods
Automated Software Testing of Asynchronous Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Our main objective is to combine partial-order methods with verification techniques for infinite-state systems in order to obtain efficient verification algorithms for concurrent infinite-state systems. Partial-order methods are commonly used in the analysis of finite systems consisting of many parallel components. In this paper we propose an extension of these methods to parallel compositions of infinite-state systems. We argue that it is advantageous to model each component by an event structure as this allows us to exhibit the concurrency present implicitly in some infinite-state systems such as automata with queues or counters. We generalize the notion of complete prefix from 1-safe Petri nets to all well-structured transition systems. We give an on-the-fly unfolding algorithm which given event structures representing the components produces an event structure representing their synchronized product. A prototype implementation demonstrates the benefits of our approach.