This is an advanced 2001 textbook on modal logic, a field which caught the attention of
computer scientists in the late 1970s. Researchers in areas ranging from economics to …

In the semantics of programming, finite data types such as finite lists, have traditionally been
modelled by initial algebras. Later final coalgebras were used in order to deal with infinite …

• There are IDEs for KeY, including an Eclipse extension, that make it easy to keep track of
proof obligations in larger projects [Hentschel et al., 2014c].• A stripped down version of …

This book develops a view of logic as a theory of information-driven agency and intelligent
interaction between many agents-with conversation, argumentation and games as guiding …

Publisher Summary From the early 1930s, there evolved two kinds of mathematical
semantics for modal logic. Algebraic semantics interprets modal connectives as operators …

The area of coalgebra has emerged within theoretical computer science with a unifying
claim: to be the mathematics of computational dynamics. It combines ideas from the theory of …

This chapter introduces the central formalism of this book, Interactive Markov Chains 1
(IMC). It arises as an integration of interactive processes and continuous-time Markov …

As its title promises, this book provides foundations for software specification and formal
software development from the perspective of work on algebraic specification. It …

The origins of bisimulation and bisimilarity are examined, in the three fields where they have
been independently discovered: Computer Science, Philosophical Logic (precisely, Modal …

The classical theory of deterministic automata is presented in terms of the notions of
homomorphism and bisimulation, which are the cornerstones of the theory of (universal) …