The Modal μ-Calculus is an extension of Modal Logic with two operators for least (μ) and greatest (ν) fixpoints of monotone functions. This logic is widely used as a tool for specification and verification of computer systems. We show that, on transitive structures, every formula of the μ-Calculus is equivalent to a Büchi automaton.

The transitive $mu$-Calculus is B"uchi definable,

LENZI, Giacomo
2006-01-01

Abstract

The Modal μ-Calculus is an extension of Modal Logic with two operators for least (μ) and greatest (ν) fixpoints of monotone functions. This logic is widely used as a tool for specification and verification of computer systems. We show that, on transitive structures, every formula of the μ-Calculus is equivalent to a Büchi automaton.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11386/1954346
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? ND
social impact