scientific article; zbMATH DE number 7559493

DOI10.4230/LIPIcs.CONCUR.2020.37MaRDI QIDQ5089304

Grégoire Sutre, Jérôme Leroux

Publication date: 18 July 2022

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

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

zbMATH Keywords

formal verificationreachability problemcounter machinevector addition systeminfinite-state system

Mathematics Subject Classification ID

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

Related Items (1)

Coverability in 2-VASS with one unary counter is in NP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the reachability problem for 5-dimensional vector addition systems
• A structure to decide reachability in Petri nets
• Deterministic one-counter automata
• Langages à un compteur
• Reachability in two-clock timed automata is PSPACE-complete
• The General Vector Addition System Reachability Problem by Presburger Inductive Invariants
• The Reachability Problem for Vector Addition System with One Zero-Test
• Reachability in Succinct and Parametric One-Counter Automata
• On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension
• Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
• An Algorithm for the General Petri Net Reachability Problem
• A Sharp Bound on Positive Solutions of Linear Diophantine Equations
• 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
• Reachability in Petri Nets with Inhibitor Arcs
• Minimal solutions of linear diophantine systems : bounds and algorithms
• The reachability problem for Petri nets is not elementary
• CONCUR 2004 - Concurrency Theory
• Vector addition system reachability problem
• Automated Technology for Verification and Analysis

This page was built for publication: