Flat Petri nets (invited talk)

DOI10.1007/978-3-030-76983-3_2MaRDI QIDQ2117150zbMATH OpenOpenAlexFDO

Authors Jérôme Leroux

Publication date 21 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-76983-3_2

zbMATH Keywords

formal methodsPetri netsPresburger arithmeticflat systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Presburger vector addition systems
• CONCUR 2004 - Concurrency Theory
• An Algorithm for the General Petri Net Reachability Problem
• scientific article; zbMATH DE number 4037227
• Acceleration for Petri nets

Cites work

• scientific article; zbMATH DE number 1670792 (Why is no real title available?)
• scientific article; zbMATH DE number 559221 (Why is no real title available?)
• scientific article; zbMATH DE number 1954380 (Why is no real title available?)
• scientific article; zbMATH DE number 1796145 (Why is no real title available?)
• scientific article; zbMATH DE number 7559504 (Why is no real title available?)
• A lower bound for the coverability problem in acyclic pushdown VAS
• A structure to decide reachability in Petri nets
• Acceleration of affine hybrid transformations
• An Algorithm for the General Petri Net Reachability Problem
• Automated Technology for Verification and Analysis
• CONCUR 2004 - Concurrency Theory
• Computation in networks of passively mobile finite-state sensors
• Demystifying Reachability in Vector Addition Systems
• Flat Parametric Counter Automata
• Flat Parametric Counter Automata
• On Flat Programs with Lists
• On iterating linear transformations over recognizable sets of integers
• On the reachability problem for 5-dimensional vector addition systems
• Parallel program schemata
• Petri nets and large finite sets
• Presburger vector addition systems
• Proving safety properties of infinite state systems by compilation into Presburger arithmetic
• Reachability in two-dimensional unary vector addition systems with states is NL-complete
• Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
• Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
• The Complexity of the Finite Containment Problem for Petri Nets
• The Power of Hybrid Acceleration
• The general vector addition system reachability problem by Presburger inductive invariants
• The reachability problem for Petri nets is not elementary
• Tools and Algorithms for the Construction and Analysis of Systems
• Vector addition system reachability problem, a short self-contained proof
• Verification of Population Protocols
• When reachability meets Grzegorczyk

Cited in

(7)

• Acceleration for Petri nets
• Presburger vector addition systems
• CONCUR 2004 - Concurrency Theory
• Long-run average behaviour of probabilistic vector addition systems
• Logics for continuous reachability in Petri nets and vector addition systems with states
• scientific article; zbMATH DE number 4037227 (Why is no real title available?)
• Ideal decompositions for vector addition systems (invited talk)

Describes a project that uses

Uses Software

• FAST
• TREX

This page was built for publication: Flat Petri nets (invited talk)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117150)