Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory

  title={Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory},
  author={Nikola Benes and Beno{\^i}t Delahaye and Ulrich Fahrenberg and Jan Křet{\'i}nsk{\'y} and Axel Legay},
There are two fundamentally different approaches to specifying and verifying properties of systems. The logical approach makes use of specifications given as formulae of temporal or modal logics and relies on efficient model checking algorithms; the behavioural approach exploits various equivalence or refinement checking methods, provided the specifications are given in the same formalism as implementations. In this paper we provide translations between the logical formalism of Hennessy… 
Refinement checking on parametric modal transition systems
A new model called parametric modal transition systems (PMTS) is introduced together with a general modal refinement notion that overcomes many of the limitations of this well-studied specification formalism of reactive systems.
Bounded Petri Net Synthesis from Modal Transition Systems is Undecidable
An equivalence between deterministic modal transition systems and a language-based formalism called modal specifications is developed, and the claim follows from a known equivalences between the conjunctive nu-calculus andmodal specifications.
A generalised theory of Interface Automata, component compatibility and error
This article presents the error-aware interface theory EMIA, where the above shortcomings are remedied by introducing explicit fatal error states and it is proved via a Galois insertion that EMIA is a conservative generalisation of the established Modal Interface Automata theory.
Quotient of Acceptance Specifications Under Reachability Constraints
A specification theory based on marked acceptance specifications (MAS) which are automata enriched with variability information encoded by acceptance sets and with reachability constraints on states is considered, ensuring reachability properties by construction.
30 Years of Modal Transition Systems: Survey of Extensions and Analysis
The specification formalism of modal transition systems (MTS) is surveyed, various extensions of MTS, their relationships and modelling capabilities are discussed, and problems arising in verification and analysis of these systems are discussed.
Compositionality for quantitative specifications
This work provides a framework for compositional and iterative design and verification of systems with quantitative information, such as rewards, time or energy based on disjunctive modal transition systems and shows how to compute the results of standard operations on the systems, including the quotient, which has not been previously considered for quantitative non-deterministic systems.
ACTL for Modal Interface Automata
  • Ferenc Bujtor, W. Vogler
  • Computer Science
    2016 16th International Conference on Application of Concurrency to System Design (ACSD)
  • 2016
Petri net synthesis and modal specifications
It is shown that that the synthesis problem for mts and the ν-calculus is undecidable, but by restricting the Petri nets considered, the synthesis Problem becomes decidable even for the more expressive μ-Calculus.
Testing Preorders for dMTS
This article regards deadlocks and divergence (infinite unobservable runs) as unwanted and characterize the testing preorder with an unusual failure-divergence semantics, which is a precongruence on dMTS, also for hiding, and much easier to handle than the deadlock-based preorder.


Proof Systems for Satisfiability in Hennessy-Milner Logic with Recursion
  • K. Larsen
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 1990
Ideal Specification Formalism + Expressivity + Compositionality + Decidability + Testability +
A main result of the paper is that a specification formalism must be at least as expressive as Hennessy-Milner Logic in order to be decomposable.
Model Checking Partial State Spaces with 3-Valued Temporal Logics
This work defines a preorder on partial Kripke structures that reflects their degree of completeness, and provides a logical characterization of this preorder that relates properties of less complete structures to properties of more complete structures.
Modal Transition Systems: Composition and LTL Model Checking
An error in a previous attempt at LTL model checking of MTS is identified and an algorithm is provided to apply this result to compositional verification and circumvent the general incompleteness of the MTS composition.
Characteristic mu-Calculus Formulas for Underspecified Transition Systems
Compositionality of Hennessy-Milner logic by structural operational semantics
Generality in design and compositional verification usingTav
The tools of the Tav-system fulfil the above requirements, and the cornerstone of the system is the theory of modal transition systems, which allows for efficient decidability, stepwise refinement, and compositionality.
Parametric Modal Transition Systems
A new model called parametric modal transition systems (PMTS) is introduced together with a general modal refinement notion that overcome many of the limitations of MTS and the computational complexity ofmodal refinement checking is investigated.
Process Algebra for Modal Transition Systemses
This work introduces transition system with obligations as a general model encompassing all the aforementioned models, and equip it with a process algebra description, to compare the previously studied subclasses and characterize their relationships.
Supervisory control for modal specifications of services
This paper investigates the adaptation of the supervisory control theory of Ramadge and Wonham to enforce a modal specification (with final states marking the ends of the sessions) on a system modelled by a finite LTS and proves there exists at most one most permissive solution to this control problem.