Handling Infinitely Branching WSTS

DOI10.1007/978-3-662-43951-7_2zbMath1382.68149OpenAlexW1708665MaRDI QIDQ5167823

Pierre McKenzie, Michael Blondin, 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)

Related Items (3)

Branch-well-structured transition systems and extensions ⋮ The ideal view on Rackoff's coverability technique ⋮ Unnamed Item

This page was built for publication: Handling Infinitely Branching WSTS