Flat Petri nets (invited talk)
From MaRDI portal
Publication:2117150
DOI10.1007/978-3-030-76983-3_2zbMath1489.68164OpenAlexW3172202899MaRDI QIDQ2117150
Publication date: 21 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-76983-3_2
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Petri nets and large finite sets
- On the reachability problem for 5-dimensional vector addition systems
- A structure to decide reachability in Petri nets
- On iterating linear transformations over recognizable sets of integers
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
- Parallel program schemata
- A lower bound for the coverability problem in acyclic pushdown VAS
- The General Vector Addition System Reachability Problem by Presburger Inductive Invariants
- Acceleration of Affine Hybrid Transformations
- An Algorithm for the General Petri Net Reachability Problem
- The Complexity of the Finite Containment Problem for Petri Nets
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
- Demystifying Reachability in Vector Addition Systems
- Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete
- When Reachability Meets Grzegorczyk
- The reachability problem for Petri nets is not elementary
- Presburger Vector Addition Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- CONCUR 2004 - Concurrency Theory
- Verification of Population Protocols
- Vector addition system reachability problem
- On Flat Programs with Lists
- Automated Technology for Verification and Analysis
- Computation in networks of passively mobile finite-state sensors
- The Power of Hybrid Acceleration
- Flat Parametric Counter Automata
- Flat Parametric Counter Automata
- Proving safety properties of infinite state systems by compilation into Presburger arithmetic
This page was built for publication: Flat Petri nets (invited talk)
