scientific article
From MaRDI portal
Publication:4036558
zbMath0769.68024MaRDI QIDQ4036558
Bernhard Steffen, Rance Cleaveland
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
fixed point logicmodel-checking algorithmcomputing preordersefficient computation of behavioral relations between processesfragment of the modal mu-calculus
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Modal logic (including the logic of norms) (03B45) Other applications of logic (03B80)
Related Items (12)
Verification and comparison of transition systems ⋮ When Are Prime Formulae Characteristic? ⋮ Data flow analysis as model checking ⋮ When are prime formulae characteristic? ⋮ Generating diagnostic information for behavioral preorders ⋮ Model-checking process equivalences ⋮ Local model checking for context-free processes ⋮ Characteristic Formulae for Timed Automata ⋮ The expressive power of implicit specifications ⋮ Complete proof systems for weighted modal logic ⋮ A linear-time model-checking algorithm for the alternation-free modal mu- calculus ⋮ CEGAR for compositional analysis of qualitative properties in Markov decision processes
This page was built for publication:
