The ideal view on Rackoff's coverability technique

DOI10.1007/978-3-319-24537-9_8zbMath1471.68169OpenAlexW2205365177MaRDI QIDQ5915733

Sylvain Schmitz, Ranko Lazić

Publication date: 27 October 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://wrap.warwick.ac.uk/73114/7/WRAP_0070379-cs-061015-lncs.pdf

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

Handling infinitely branching well-structured transition systems ⋮ Unnamed Item ⋮ The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings ⋮ Probabilistic automata of bounded ambiguity ⋮ Probabilistic Automata of Bounded Ambiguity

This page was built for publication: The ideal view on Rackoff's coverability technique