Separability and non-determinizability of WSTS

DOI10.4230/LIPICS.CONCUR.2023.8MaRDI QIDQ6967341zbMATH OpenFDO

Authors Eren Keskin, Roland Meyer

Publication date 26 June 2025

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

determinizationregular separabilityWSTS

Mathematics Subject Classification ID

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

Cites work

• A characterization for decidable separability by piecewise testable languages
• A note on well quasi-orderings for powersets
• An Approach to Regular Separability in Vector Addition Systems
• Chain-complete posets and directed sets with applications
• Comparing the Expressive Power of Well-Structured Transition Systems
• Convergence lattices
• Demystifying Reachability in Vector Addition Systems
• Forward Analysis for WSTS, Part II: Complete WSTS
• Forward analysis for WSTS. II: Complete WSTS
• Handbook of model checking
• Handling infinitely branching WSTS
• scientific article; zbMATH DE number 4030997 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 1223710 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 7354705 (Why is no real title available?)
• scientific article; zbMATH DE number 7559472 (Why is no real title available?)
• Noetherian Spaces in Verification
• Partial well‐ordering of sets of vectors
• Principles of abstract interpretation
• Regular Separability and Intersection Emptiness Are Independent Problems
• Regular separability in Büchi VASS
• Regular separability of one counter automata
• Regular separability of Parikh automata
• Regular separability of well-structured transition systems
• Separability by piecewise testable languages and downward closures beyond subwords
• Separability of reachability sets of vector addition systems
• Tentative steps toward a development method for interfering programs
• Timed games and deterministic separability
• Unboundedness problems for languages of vector addition systems
• Une extension d'un théorème de P. Jullien sur les âges de mots
• Well-structured languages
• Well-structured transition systems everywhere!

Cited in

(3)

• Separability in Büchi VASS and singly nonlinear systems of inequalities
• On the separability problem of VASS reachability languages
• The complexity of separability for semilinear sets and Parikh automata

This page was built for publication: Separability and non-determinizability of WSTS

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