Structural Refinement for the Modal nu-Calculus

  title={Structural Refinement for the Modal nu-Calculus},
  author={Ulrich Fahrenberg and Axel Legay and Louis-Marie Traonouez},
We introduce a new notion of structural refinement, a sound abstraction of logical implication, for the modal nu-calculus. Using new translations between the modal nu-calculus and disjunctive modal transition systems, we show that these two specification formalisms are structurally equivalent. 

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.

Behavioral Specification Theories: an Algebraic Taxonomy

This work starts by clarifying what precisely constitutes a behavioral specification theory and then introduces logical and structural operations and develops the resulting algebraic properties.

ACTL for Modal Interface Automata

  • Ferenc BujtorW. Vogler
  • Computer Science
    2016 16th International Conference on Application of Concurrency to System Design (ACSD)
  • 2016

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.

A Linear-Time-Branching-Time Spectrum of Behavioral Specification Theories

It is shown that specification theories for preorders cannot exist and a general scheme is developed which allows us to define behavioral specification theories, based on disjunctive modal transition systems, for most equivalences in the linear-time–branching-time spectrum.

Observational Refinement and Merge for Disjunctive MTSs

Disjunctive MTS (DMTS) is an extension of MTS that has been getting attention in recent years, and a key concept for (D)MTS is refinement, supporting a development process where abstract specifications are gradually refined into more concrete ones.

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.



Results on the Propositional µ-Calculus

A propositional version of the Μ-calculus is defined, and an exponential-time decision procedure, small model property, and complete deductive system is given, and it is shown that it is strictly more expressive than PDL.

Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics

The satisfaction problem of a probabilistic HML formula for a process term is reduced to the question of whether its subterms satisfy a derived formula obtained via the operational semantics.

A Spatial Logic for Concurrency

A central theme of this paper is the combination of a logical notion of freshness with inductive and coinductive definitions of properties.

A spatial logic for concurrency (part I)

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.

Graphical Versus Logical Specifications

Quantitative Refinement for Weighted Modal Transition Systems

This work proposes the first specification theory which allows to capture quantitative aspects during the refinement and implementation process of component-based software systems.

On determinism in modal transition systems

A Complete Axiomatic System for a Process-Based Spatial Logic

This paper proposes a sound-complete Hilbert-style axiomatic system for a particular spatial logic that combines the basic spatial operators with dynamic and classical operators, and proves the logic decidable both for satisfiability/validity and mode-checking.