Reachability in vector addition systems is Ackermann-complete
Vector Addition Systems and equivalent Petri nets are a well established models of
concurrency. The central algorithmic problem for Vector Addition Systems with a long …
concurrency. The central algorithmic problem for Vector Addition Systems with a long …
The reachability problem for Petri nets is not primitive recursive
J Leroux - 2021 IEEE 62nd Annual Symposium on …, 2022 - ieeexplore.ieee.org
The Reachability Problem for Petri Nets is Not Primitive Recursive Page 1 The Reachability
Problem for Petri Nets is Not Primitive Recursive Jérôme Leroux Univ. Bordeaux, CNRS …
Problem for Petri Nets is Not Primitive Recursive Jérôme Leroux Univ. Bordeaux, CNRS …
The reachability problem for Petri nets is not elementary
Petri nets, also known as vector addition systems, are a long established model of
concurrency with extensive applications in modeling and analysis of hardware, software …
concurrency with extensive applications in modeling and analysis of hardware, software …
An algorithm for the general Petri net reachability problem
EW Mayr - Proceedings of the thirteenth annual ACM symposium …, 1981 - dl.acm.org
An algorithm is presented for the general Petri net reachability problem based on a
generalization of the basic reachability construction which is symmetric with respect to the …
generalization of the basic reachability construction which is symmetric with respect to the …
[PDF][PDF] Decidability issues for Petri nets--a survey
arxiv:2411.01592v1 [cs.FL] 3 Nov 2024 Page 1 arxiv:2411.01592v1 [cs.FL] 3 Nov 2024
Decidability Issues for Petri Nets – a survey1 Javier Esparza∗ Mogens Nielsen Institut für …
Decidability Issues for Petri Nets – a survey1 Javier Esparza∗ Mogens Nielsen Institut für …
Decidability of reachability in vector addition systems (preliminary version)
SR Kosaraju - Proceedings of the fourteenth annual ACM symposium …, 1982 - dl.acm.org
© 1982 ACMO-89791-067-2/82/O05/0267 $00.75 Page 1 DECIDABILITY OF REACHABILITY
IN VECTOR ADDITION SYSTEMS Perliminary Version + S. Ran Kosaraju The Johns Hopkins …
IN VECTOR ADDITION SYSTEMS Perliminary Version + S. Ran Kosaraju The Johns Hopkins …
The computational power of population protocols
We consider the model of population protocols introduced by Angluin et al.(Computation in
networks of passively mobile finite-state sensors, pp. 290–299. ACM, New York, 2004), in …
networks of passively mobile finite-state sensors, pp. 290–299. ACM, New York, 2004), in …
Reachability in vector addition systems is primitive-recursive in fixed dimension
The reachability problem in vector addition systems is a central question, not only for the
static verification of these systems, but also for many inter-reducible decision problems …
static verification of these systems, but also for many inter-reducible decision problems …
A structure to decide reachability in Petri nets
JL Lambert - Theoretical Computer Science, 1992 - Elsevier
A new structure to analyse Petri nets and decide reachability is presented. Originated in
Mary's regular constraint graphs with a consistent marking, it is simplified, cleared and made …
Mary's regular constraint graphs with a consistent marking, it is simplified, cleared and made …
[LIBRO][B] Computation and automata
A Salomaa - 1985 - books.google.com
This introduction to certain mathematical topics central to theoretical computer science treats
computability and recursive functions, formal languages and automata, computational …
computability and recursive functions, formal languages and automata, computational …