Toward uniform random generation in 1-safe Petri nets
Formal Languages and Automata Theory
2017-06-20 v1 Discrete Mathematics
Abstract
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.
Keywords
Cite
@article{arxiv.1706.05888,
title = {Toward uniform random generation in 1-safe Petri nets},
author = {Samy Abbes},
journal= {arXiv preprint arXiv:1706.05888},
year = {2017}
}
Comments
10 pages, 2 figures. In GASCOM 2016 proceedings