Toward uniform random generation in 1-safe Petri nets

We study the notion of uniform measure on the space of infinite executions of a 1-safe Petri net. Here, executions of 1-safe Petri nets are understood up to commutation of concurrent transitions, which introduces a challenge compared to usual transition systems. We obtain that the random generation...

Full description

Saved in:
Bibliographic Details
Published inElectronic notes in discrete mathematics Vol. 59; pp. 3 - 17
Main Author Abbes, Samy
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.06.2017
Subjects
partial order model
Petri net
uniform generation
uniform generation
Petri net
partial order model
Online AccessGet full text

Cover

More Information
Summary:We study the notion of uniform measure on the space of infinite executions of a 1-safe Petri net. Here, executions of 1-safe Petri nets are understood up to commutation of concurrent transitions, which introduces a challenge compared to usual transition systems. We obtain that the random generation of infinite executions reduces to the simulation of a finite state Markov chain. Algorithmic issues are discussed.
ISSN:1571-0653
1571-0653
DOI:10.1016/j.endm.2017.05.002