Language inclusion for boundedly-ambiguous vector addition systems is decidable

DOI10.4230/LIPICS.CONCUR.2022.16MaRDI QIDQ6587122zbMATH OpenFDO

Authors Wojciech Czerwiński, Piotr Hofman

Publication date 13 August 2024

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2022.16

zbMATH Keywords

bounded ambiguitydeterminismlanguage equivalencelanguage inclusionPetri netsunambiguityvector addition systemswell-structured transition systems

Mathematics Subject Classification ID

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

Cited in

(8)

• Weighted basic parallel processes and combinatorial enumeration
• Separability in Büchi VASS and singly nonlinear systems of inequalities
• On the containment problem for deterministic multicounter machine models
• History-deterministic vector addition systems
• Determinisation and unambiguisation of polynomially-ambiguous rational weighted automata
• Soundness of reset workflow nets
• Language inclusion for boundedly-ambiguous vector addition systems is decidable
• Languages of boundedly-ambiguous vector addition systems with states

This page was built for publication: Language inclusion for boundedly-ambiguous vector addition systems is decidable

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