Flat Petri nets (invited talk)

DOI10.1007/978-3-030-76983-3_2zbMATH Open1489.68164OpenAlexW3172202899MaRDI QIDQ2117150FDOQ2117150

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)

Cites Work

• Title not available (Why is that?)
• Parallel program schemata
• The Complexity of the Finite Containment Problem for Petri Nets
• Verification of Population Protocols
• Title not available (Why is that?)
• Flat Parametric Counter Automata
• Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
• CONCUR 2004 - Concurrency Theory
• Automated Technology for Verification and Analysis
• On the reachability problem for 5-dimensional vector addition systems
• A structure to decide reachability in Petri nets
• Title not available (Why is that?)
• Vector addition system reachability problem
• An Algorithm for the General Petri Net Reachability Problem
• Computation in networks of passively mobile finite-state sensors
• Tools and Algorithms for the Construction and Analysis of Systems
• The Power of Hybrid Acceleration
• Proving safety properties of infinite state systems by compilation into Presburger arithmetic
• Demystifying Reachability in Vector Addition Systems
• Presburger Vector Addition Systems
• Title not available (Why is that?)
• On Flat Programs with Lists
• Petri nets and large finite sets
• Flat Parametric Counter Automata
• On iterating linear transformations over recognizable sets of integers
• The general vector addition system reachability problem by Presburger inductive invariants
• The reachability problem for Petri nets is not elementary
• Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
• A lower bound for the coverability problem in acyclic pushdown VAS
• Acceleration of Affine Hybrid Transformations
• Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete
• Title not available (Why is that?)
• When Reachability Meets Grzegorczyk

Cited In (1)

• CONCUR 2004 - Concurrency Theory

Uses Software

• TREX
• FAST

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)