Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
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)
Information and Computation
Process semantics for place/transition nets with inhibitor and read arcs
Fundamenta Informaticae - Special issue prepared in tribute to Peter Ernst on the occasion of his retirement
Partial order semantics and read arcs
Theoretical Computer Science
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Modelling and Analysis of Distributed Software Using GSPNs
Lectures on Petri Nets II: Applications, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Protocol Specification Using P-Graphs, a Technique Based on Coloured Petri Nets
Lectures on Petri Nets II: Applications, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Process semantics of general inhibitor nets
Information and Computation
Processes of Petri Nets with Range Testing
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Processes of membrane systems with promoters and inhibitors
Theoretical Computer Science
Synchrony and asynchrony in membrane systems
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Petri nets with localities and testing
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Processes of Petri Nets with Range Testing
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
| Hi-index | 0.00 |
This paper is concerned with defining causality semantics for infinite executions of Petri nets with inhibitor arcs. We first show how one can deal with infinite step sequences and the corresponding occurrence nets (processes) and causal structures. We then discuss how to improve the succinctness of both finite and infinite processes generated from step sequences. In the latter case, the proposed constructions avoid infinite branching in the case of bounded nets.