Abstract
A modal transition system has a class of implementations, its maximal refinements. This class determines satisfiability and validity judgments, and their compositional approximations, for formulas of Hennessy-Milner logic. Using topology, we prove structural properties of these judgments: refinement is reverse containment of classes of implementations, Hennessy-Milner logic characterizes refinement through validity judgments, implementation classes are topologically closed sets, Hennessy-Milner logic enjoys a compactness theorem on such classes, and a robust consistency measure between modal transition systems is definable. In particular, every formula of Hennessy-Milner logic is the finite disjunction of Hennessy-Milner logic formulas for which validity checks are reducible to model checks.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
