Structure theory of Petri nets: the free choice hiatus
Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Branching processes of Petri nets
Acta Informatica
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)
Verification of asynchronous circuits using time Petri net unfolding
DAC '96 Proceedings of the 33rd annual Design Automation Conference
Contextual Petri nets, asymmetric event structures, and processes
Information and Computation
An Improvement of McMillan's Unfolding Algorithm
Formal Methods in System Design
Unfolding and Finite Prefix for Nets with Read Arcs
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Model Checking of Time Petri Nets Based on Partial Order Semantics
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Time Processes for Time Petri-Nets
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Abstractions and Partial Order Reductions for Checking Branching Properties of Time Petri Nets
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Computing a Finite Prefix of a Time Petri Net
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Diagnosis using unfoldings of parametric time Petri nets
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed 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
An algorithm for direct construction of complete merged processes
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Timed unfoldings for networks of timed automata
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Symbolic unfoldings for networks of timed automata
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
Symbolic unfolding of parametric stopwatch Petri nets
Formal Methods in System Design
| Hi-index | 0.00 |
Time Petri nets have proved their interest in modeling real-time concurrent systems. Their usual semantics is defined in term of firing sequences, which can be coded in a (symbolic and global) state graph, computable from a bounded net. An alternative is to consider a “partial order” semantics given in term of processes, which keep explicit the notions of causality and concurrency without computing arbitrary interleavings. In ordinary place/transition bounded nets, it has been shown for many years that the whole set of processes can be finitely represented by a prefix of what is called the “unfolding”. This paper defines such a prefix for safe time Petri nets. It is based on a symbolic unfolding of the net, using a notion of “partial state”.