Failing model checking runs should be accompanied by appropriate error diagnosis
information that allows the user to identify the cause of the problem. For branching time …

We rst present a rst-order modal-calculus which uses parameterised maximal and minimal
xpoints to describe safety and liveness properties of processes which communicate values …

Synchronous programming languages are well-suited for the design of safety-critical real-
time embedded systems. However, the compilers and synthesis procedures are challenged …

We present the first compositional proof system for checking processes against formulas in
the modalμ-calculus which is capable of handling dynamic process networks. The proof …

We suggest a three-level integrated approach to design, specification and verification of
distributed system. The approach is based on a newly designed specification language …

Paritätsspiele sind unendliche Zwei-Personen-Spiele, hier betrachtet auf endlichen
Graphen. Eine Partie ist ein unendlicher Pfad durch den Graphen, der von den beiden …

Program logics are modal logics for reasoning about programs and systems. In general case
of semantics we examine the expressive power, model checking and decidability for …

This paper presents a formal requirements engineering method capturing specification,
synthesis, and verification. Being multi-paradigm, our approach integrates individual …

We initiate a study of automata-based model checking for previously proposed quantitative
linear time logics interpreted over coalgebras. Our results include:(i) an automata-theoretic …