Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Branching processes of Petri nets
Acta Informatica
Fundamenta Informaticae - Special issue on Petri nets
Model checking
An Improvement of McMillan's Unfolding Algorithm
Formal Methods in System Design
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
An Unfolding Algorithm for Synchronous Products of Transition Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
LP Deadlock Checking Using Partial Order Dependencies
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
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
Deadlock Checking Using Net Unfoldings
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Computing a Finite Prefix of a Time Petri Net
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Canonical Prefixes of Petri Net Unfoldings
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Dealing with practical limitations of distributed timed model checking for timed automata
Formal Methods in System Design
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
A false history of true concurrency: from Petri to tools
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Distributed unfolding of petri nets
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Reduced MDP representation of a logistical planning problem using petri-nets
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |
In this paper, we first present theoretical results, helping to understand the unfolding algorithm presented in [6,7]. We then propose a modification of this algorithm, which can be efficiently parallelised and admits a more efficient implementation. Our experiments demonstrate that the degree of parallelism is usually quite high and resulting algorithms potentially can achieve significant speedup comparing with the sequential case.