Decidability and complexity of decision problems for affine continuous vass

DOI10.1145/3661814.3662124MaRDI QIDQ6970276zbMATH OpenFDO

Authors A. R. Balasubramanian

Publication date 18 June 2025

Full work available at URL https://doi.org/10.1145/3661814.3662124

zbMATH Keywords

complexitycoverabilitydecidabilityreachabilityvector addition systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• Affine extensions of integer vector addition systems with states
• Analysis of Boolean Programs
• Directed reachability for infinite-state systems
• Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
• scientific article; zbMATH DE number 2080048 (Why is no real title available?)
• scientific article; zbMATH DE number 7407775 (Why is no real title available?)
• Logics for continuous reachability in Petri nets and vector addition systems with states
• Loop summarization with rational vector addition systems
• Reachability in vector addition systems is Ackermann-complete
• Real addition and the polynomial hierarchy
• Reasoning about systems with many processes
• The logical view on continuous Petri nets
• The reachability problem for Petri nets is not primitive recursive
• Verification of population protocols
• Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations
• Well-structured transition systems everywhere!

Cited in

(1)

• On continuous pushdown VASS in one dimension

This page was built for publication: Decidability and complexity of decision problems for affine continuous vass

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