Petri Nets and Higher-Dimensional Automata
Logic in Computer Science
2025-02-05 v1
Abstract
Petri nets and their variants are often considered through their interleaved semantics, i.e. considering executions where, at each step, a single transition fires. This is clearly a miss, as Petri nets are a true concurrency model. This paper revisits the semantics of Petri nets as higher-dimensional automata (HDAs) as introduced by van Glabbeek, which methodically take concurrency into account. We extend the translation to include some common features. We consider nets with inhibitor arcs, under both concurrent semantics used in the literature, and generalized self-modifying nets. Finally, we present a tool that implements our translations.
Keywords
Cite
@article{arxiv.2502.02354,
title = {Petri Nets and Higher-Dimensional Automata},
author = {Amazigh Amrane and Hugo Bazille and Uli Fahrenberg and Loïc Hélouët and Philipp Schlehuber-Caissier},
journal= {arXiv preprint arXiv:2502.02354},
year = {2025}
}