scientific article; zbMATH DE number 7561336

DOI10.4230/LIPIcs.FSTTCS.2018.31MaRDI QIDQ5090970

Grégoire Sutre, Jérôme Leroux, Alain Finkel

Publication date: 21 July 2022

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

zbMATH Keywords

formal verificationreachability problemPresburger arithmeticcounter machinevector addition systeminfinite-state system

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Related Items (3)

Unnamed Item ⋮ Coverability in 2-VASS with one unary counter is in NP ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the reachability problem for 5-dimensional vector addition systems
• What makes Petri nets harder to verify: stack or data?
• The Reachability Problem for Vector Addition System with One Zero-Test
• Reachability in Succinct and Parametric One-Counter Automata
• Mixing Coverability and Reachability to Analyze VASS with One Zero-Test
• Hyper-Ackermannian bounds for pushdown vector addition systems
• 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
• On Petri Nets with Hierarchical Special Arcs
• CONCUR 2004 - Concurrency Theory
• Analysis 1
• Well-structured transition systems everywhere!

This page was built for publication: