Branching processes of Petri nets
Acta Informatica
Stochastic Well-Formed Colored Nets and Symmetric Modeling Applications
IEEE Transactions on Computers
A Model Checking Method for Partially Symmetric Systems
FORTE/PSTV 2000 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Specification, Testing and Verification (PSTV XX)
A New Unfolding Approach to LTL Model Checking
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
An Improvement of McMillan's Unfolding Algorithm
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Model Checking Using Net Unfoldings
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
An Unfolding Algorithm for Synchronous Products of Transition Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
A Complete Finite Prefix for Process Algebra
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Detection of Illegal Behaviors Based on Unfoldings
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Designing a LTL model-checker based on unfolding graphs
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Canonical Prefixes of Petri Net Unfoldings
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
A false history of true concurrency: from Petri to tools
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Modular Construction of Finite and Complete Prefixes of Petri net Unfoldings
Fundamenta Informaticae - Application of Concurrency to System Design
| Hi-index | 0.00 |
This paper presents a general technique for the modular construction ofcomplete prefixes adapted to systems composed ofP etri nets. This construction is based on a definition ofa well-adapted order allowing combination. Moreover, the proposed technique takes into account the symmetries ofthe system to minimize the size ofthe produced complete prefixes. Finally, the technique has been instantiated in an efficient algorithm for systems combining finite state machines and k-bounded queues with k a priori known or not.