Computer Science – Logic in Computer Science
Scientific paper
2004-12-15
LMCS 1 (1:1) 2005
Computer Science
Logic in Computer Science
Changes since v2: Metadata update
Scientific paper
10.2168/LMCS-1(1:1)2005
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.
No associations
LandOfFree
Labelled transition systems as a Stone space does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Labelled transition systems as a Stone space, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Labelled transition systems as a Stone space will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-92349