Modal Logic and Process Algebra
A Bisimulation Perspective
Will be published approx. on 1. June 1995
Book
Paperback/Softback
352 pages
978-1-881526-96-4 (ISBN)
Description
Labelled transition systems are mathematical models for dynamic behaviour, or processes, and thus form a research field of common interest to logicians and theoretical computer scientists. In computer science, this notion is a fundamental 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 volume 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 processes represented by these structures. The volume offers an up-to-date overview of perspectives on labelled transition systems and bisimulations.
More details
Series
Language
English
Place of publication
Stanford
United States
Target group
College/higher education
Product notice
Paperback (trade)
Dimensions
Height: 228 mm
Width: 152 mm
Thickness: 20 mm
Weight
482 gr
ISBN-13
978-1-881526-96-4 (9781881526964)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Persons
Content
List of contributors; Preface; Introduction; 1. Submodel Preservation Theorems in Finite Variable Fragments H. Andreka, J. van Benthem, and I. Nemeti; 2. Process Algebra with Feedback J. C. M. Baeten, J. A. Bergstra, and Gh. Stefanescu; 3. Frame-Based Process Logics J. A. Bergstra and A. Ponse; 4. Re-interpreting the Modal m-Calculus Marcello M. Bonsangue and Marta Z. Kwiatkowska; 5. Bisimulation of Context-Free Grammars and of Pushdown Automata Didier Caucal; 6. Saturation and the Hennessy-Milner Property Robert Goldblatt; 7. A Modal Logic for mCRL J. F. Groote and S. F. M. van Vlijmen; 8. Deciding Equivalences in Simple Process Algebras Yoram Hirshfeld and Faron Moller; 9. Expressive Completeness of Until and Since over Dedekind; 10. Hennessy-Milner Classes and Process Algebra Marco Hollenberg; 11. A Lindstrom Theorem for Modal Logic; 12. A Calculus of Transition Systems (towards Universal Coalgebra) J. J. M. M. Rutten; 13. On the Parallel Complexity of Bisimulation and Model Checking Scott A. Smolka, Oleg Sokolsky and Shipei Zhang; 14. NNIL, a Study in Intuitionistic Propositional Logic Albert Visser, Johan van Benthem, Dick de Jongh and Gerard R. Renardel de Lavalette; Appendix A: IPC as a Fragment of Predicate Logic; Appendix B:Zigzag-simulations; B.1 Extended Numbers; B.2 Basics of Zigzag-simulations; B.3 Preorders based on Zigzag-simulations; B.4 Main Results; References; Author Index.