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
Black Box Unfolding with Local First Search
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Parallelisation of the Petri Net Unfolding Algorithm
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Towards an Efficient Algorithm for Unfolding Petri Nets
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
MARRELLA and the Verification of an Embedded System
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Unfolding of Products of Symmetrical Petri Nets
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
A false history of true concurrency: from Petri to tools
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
An approach to unfolding asynchronous communication protocols
FM'05 Proceedings of the 2005 international conference on Formal Methods
From automata networks to HMSCs: a reverse model engineering perspective
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Symbolic unfoldings for networks of timed automata
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
The implementation of mazurkiewicz traces in POEM
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Using unfoldings in automated testing of multithreaded programs
Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering
Modular Construction of Finite and Complete Prefixes of Petri net Unfoldings
Fundamenta Informaticae - Application of Concurrency to System Design
Unfolding Based Algorithms for the Reachability Problem
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
| Hi-index | 0.00 |
The unfolding method, initially introduced for systems modelled by Petri nets, is applied to synchronous products of transition systems, a model introduced by Arnold [2]. An unfolding procedure is provided which exploits the product structure of the model. Its performance is evaluated on a set of benchmarks.