An Approach to Regular Separability in Vector Addition Systems

DOI10.1145/3373718.3394776MaRDI QIDQ5145646zbMATH OpenOpenAlexFDO

Authors Wojciech Czerwiński, Georg Zetzsche

Publication date 21 January 2021

Published in Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

decidabilityseparability problemvector addition systems

Mathematics Subject Classification ID

Computer science (68-XX)

Cited in

(10)

• scientific article; zbMATH DE number 2247473 (Why is no real title available?)
• Separability in Büchi VASS and singly nonlinear systems of inequalities
• Counter machines with infrequent reversals
• Regular separators for VASS coverability languages
• Separability and non-determinizability of WSTS
• On the separability problem of VASS reachability languages
• Verifying unboundedness via amalgamation
• Deterministic and game separability for regular languages of infinite trees
• The complexity of separability for semilinear sets and Parikh automata
• Languages of boundedly-ambiguous vector addition systems with states

This page was built for publication: An Approach to Regular Separability in Vector Addition Systems

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