scientific article; zbMATH DE number 7559504

DOI10.4230/LIPIcs.CONCUR.2020.48MaRDI QIDQ5089315

Ranko Lazić, Jérôme Leroux, Filip Mazowiecki, Wojciech Czerwiński, Sławomir Lasota

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/2001.04327

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Petri netsreachability problemvector addition systems

Mathematics Subject Classification ID

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

Related Items (2)

Coverability in 2-VASS with one unary counter is in NP ⋮ Flat Petri nets (invited talk)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Verification of population protocols
• Petri nets for modelling metabolic pathways: a survey
• A theory of structural stationarity in the \(\pi\)-calculus
• On the reachability problem for 5-dimensional vector addition systems
• Deterministic one-counter automata
• The covering and boundedness problems for vector addition systems
• Remarks on blind and partially blind one-way multicounter machines
• A multiparameter analysis of the boundedness problem for vector addition systems
• Petri nets, Horn programs, linear logic and vector games
• Parallel program schemata
• Reasoning about Data Repetitions with Counter Systems
• Two-variable logic on data words
• Generalized Data Automata and Fixpoint Logic
• Persistence Results for Chemical Reaction Networks with Time-Dependent Kinetics and No Global Conservation Laws
• Reachability in Succinct and Parametric One-Counter Automata
• Ordered Navigation on Multi-attributed Data Words
• On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension
• Two-variable logic on data trees and XML reasoning
• An Algorithm for the General Petri Net Reachability Problem
• Petri nets and szilard languages
• Reasoning about systems with many processes
• Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete
• Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete
• The reachability problem for Petri nets is not elementary
• CONCUR 2004 - Concurrency Theory
• Proving safety properties of infinite state systems by compilation into Presburger arithmetic

This page was built for publication: