Labelled transition systems as a Stone space
<|reference_start|>Labelled transition systems as a Stone space: A fully abstract and universal domain model for modal transition systems and refinement is shown to be a maximal-points space model for the bisimulation quotient of labelled transition systems over a finite set of events. In this domain model we prove that this quotient is a Stone space whose compact, zero-dimensional, and ultra-metrizable Hausdorff topology measures the degree of bisimilarity such that image-finite labelled transition systems are dense. Using this compactness we show that the set of labelled transition systems that refine a modal transition system, its ''set of implementations'', is compact and derive a compactness theorem for Hennessy-Milner logic on such implementation sets. These results extend to systems that also have partially specified state propositions, unify existing denotational, operational, and metric semantics on partial processes, render robust consistency measures for modal transition systems, and yield an abstract interpretation of compact sets of labelled transition systems as Scott-closed sets of modal transition systems.<|reference_end|>
@article{huth2004labelled,
    title={Labelled transition systems as a Stone space},
    author={Michael Huth},
    journal={Logical Methods in Computer Science, Volume 1, Issue 1 (January
  26, 2005) lmcs:2271},
    year={2004},
    doi={10.2168/LMCS-1(1:1)2005},
    archivePrefix={arXiv},
    eprint={cs/0412063},
    primaryClass={cs.LO}
}