Labeled transition systems are mathematical models for dynamic beaviour, or processes, and thus form a research field of common interest to logicians and theoretical computer scientists. In computer science, this notion is a fundementals one in the formal analysis of programming languages, in particular in process theory. In modal logic, transition systems are the central object of study under the name of Kripke models.
This voulme collects a number of research papers on modal logic and process theory. Its unifying theme is the notion of a bisimulation. Bisimulations are relations over transition systems, and provide a key tool in identifying the process represented by these structures.
This volume offers an up-to-date overview of perspectives on labeled transition system and bisimulations.
is a lecturer in the department of mathematics and computer science at the University of Amsterdam. is research scientist at the Centre of Mathematics and Computer Science in Amsterdam. is a KNAW research fellow in the department of mathematics and computer science at the Free University in Amsterdam.
- 1 Submodel Preservation Theorems in Finite Variable Fragments
- 2 Process Algebra with Feedback
- 3 Frame-Based Process Logics
- 4 Re-interpreting the Modal μ-Calculus
- 5 Bisimulation of Context-Free Grammars and Pushdown Automata
- 6 Saturation and the Hennessy-Milner Property
- 7 A Modal Logic for μCRL
- 8 Deciding Equivalences in Simple Process Algebras
- 9 Expressive Completeness of Until and Since over Dedekind Complete Linear Time
- 10 Hennessy-Milner Classes and Process Algebra
- 11 A Lindström Theorem for Modal Logic
- 12 A Calculus of Transition Systems (towards Universal Coalgebra)
- 13 On the Parallel Complexity of Bisimulation and Model Checking
- 14 NNIL, a Study in Intuitionistic Propositional Logic
- Author Index