Handling infinitely branching WSTS

DOI10.1007/978-3-662-43951-7_2MaRDI QIDQ5167823zbMATH OpenOpenAlexFDO

Authors Michael Blondin, Pierre McKenzie, Alain Finkel

Publication date 1 July 2014

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-43951-7_2

Mathematics Subject Classification ID

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

Recommendations

• Handling infinitely branching well-structured transition systems
• Well-structured transition systems everywhere!
• Branch-well-structured transition systems and extensions
• scientific article; zbMATH DE number 6790161
• The power of well-structured systems

Cited in

(9)

• Handling infinitely branching well-structured transition systems
• Algorithmic analysis of programs with well quasi-ordered domains.
• Branch-well-structured transition systems and extensions
• The power of well-structured systems
• Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
• Forward analysis for WSTS. III: Karp-Miller trees
• The ideal view on Rackoff's coverability technique
• Branch-well-structured transition systems and extensions
• Separability and non-determinizability of WSTS

This page was built for publication: Handling infinitely branching WSTS

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