Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory
Beneš, Nikola;Delahaye, Benoît;Fahrenberg, Uli;Křetínský, Jan;Legay, Axel
(2013) CONCUR 2013 - 24th International Conference Concurrency Theory (27.August.2013)
Files
No attached file found for this publication.
Details
Authors
Beneš, Nikola
Author
Delahaye, Benoît
Author
Fahrenberg, Uli
Author
Křetínský, Jan
Author
Legay, AxelUCLouvain
Author
Abstract
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-Milner logic with greatest fixed points and the behavioural formalism of disjunctive modal transition systems. We also introduce a new operation of quotient for the above equivalent formalisms, which is adjoint to structural composition and allows synthesis of missing specifications from partial implementations. This is a substantial generalisation of the quotient for deterministic modal transition systems defined in earlier papers.
Citations
APA
Chicago
FWB
Beneš, N., Delahaye, B., Fahrenberg, U., Křetínský, J., & Legay, A. (2013). Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory. CONCUR 2013 – Concurrency Theory Lecture Notes in Computer Science. CONCUR 2013 - 24th International Conference Concurrency Theory. https://doi.org/10.1007/978-3-642-40184-8_7