A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
Branching processes of Petri nets
Acta Informatica
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Fundamenta Informaticae - Special issue on Petri nets
Model checking
An Improvement of McMillan's Unfolding Algorithm
Formal Methods in System Design
PEP - More than a Petri Net Tool
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for 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
A Class of Composable High Level Petri Nets with an Application to the Semantics of B(PN)2
Proceedings of the 16th 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
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
Asynchronous Circuit Synthesis by Direct Mapping: Interfacing to Environment
ASYNC '02 Proceedings of the 8th International Symposium on Asynchronus Circuits and Systems
A Petri Net Semantics for B(PN)^2 with Procedures
PDSE '97 Proceedings of the 2nd International Workshop on Software Engineering for Parallel and Distributed Systems
Faster Unfolding of General Petri Nets Based on Token Flows
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Directed Unfolding of Petri Nets
Transactions on Petri Nets and Other Models of Concurrency I
Complete Process Semantics of Petri Nets
Fundamenta Informaticae
Unfolding Semantics of Petri Nets Based on Token Flows
Fundamenta Informaticae - Petri Nets 2008
Unfolding concurrent well-structured transition systems
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Symbolic unfolding of parametric stopwatch Petri nets
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
A false history of true concurrency: from Petri to tools
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
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
Factorization properties of symbolic unfoldings of colored petri nets
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Unfolding Semantics of Petri Nets Based on Token Flows
Fundamenta Informaticae - Petri Nets 2008
Complete Process Semantics of Petri Nets
Fundamenta Informaticae
Symbolic unfolding of parametric stopwatch Petri nets
Formal Methods in System Design
| Hi-index | 0.00 |
In this paper, we define branching processes and unfoldings of high-level Petri nets and propose an algorithm which builds finite and complete prefixes of such unfoldings. The advantage of our method is that it avoids a potentially expensive translation of a high-level Petri net into a low-level one. The approach is conservative as all the verification tools employing the traditional unfoldings can be reused with prefixes derived directly from high-level nets. We show that this is often better than the usual explicit construction of the intermediate low-level net.