Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
Branching processes of Petri nets
Acta Informatica
Executions: a new partial-order semantics of Petri nets
Theoretical Computer Science
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)
An event structure semantics for general Petri nets
Theoretical Computer Science - Special volume on Petri nets
On the Model of Computation of Place/Transition Petri Nets
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Theoretical Computer Science
Configuration structures, event structures and Petri nets
Theoretical Computer Science
Branching processes of general petri nets
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Hi-index | 0.00 |
We propose a new model of branching processes, suitable for describing the behavior of general Petri nets, without any finiteness or safeness assumption. In this framework, we define a new class of branching processes and unfoldings of a net N, which we call faithful. These coincide with the safe branching processes and unfoldings if N is safe, or weakly safe as in [Engelfriet 1991], but not in general. However, faithful branching processes and processes satisfy the good order-theoretic properties which make the safe processes of safe nets so useful in practice, and which are known not to hold for the safe processes of a general net. Faithful processes represent therefore good candidates to generalize the theory of safe nets to the general case.