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

DOI10.1007/978-3-642-40184-8_7zbMath1271.68131arXiv1306.0741OpenAlexW167034675MaRDI QIDQ2842098

Nikola Beneš, Jan Křetínský, Benoît Delahaye, Axel Legay, Uli Fahrenberg

Publication date: 12 August 2013

Published in: CONCUR 2013 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.0741

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (8)

Nondeterministic modal interfaces ⋮ ACTL for modal interface automata ⋮ A generalised theory of interface automata, component compatibility and error ⋮ Unnamed Item ⋮ Compositionality for quantitative specifications ⋮ A linear-time-branching-time spectrum for behavioral specification theories ⋮ Logical vs. behavioural specifications ⋮ Refinement checking on parametric modal transition systems

Uses Software

• MIO Workbench

This page was built for publication: Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory