LIPIcs.CSL.2011.2.pdf
- Filesize: 188 kB
- 1 pages
Document
The Freedoms of Guarded Bisimulation
Author
-
Part of:
Volume:
Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL (CSL 2011)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Computer Science Logic (CSL) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2011-08-31
Cite As Get BibTex
Martin Otto. The Freedoms of Guarded Bisimulation. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, p. 2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/LIPIcs.CSL.2011.2
Abstract
Guarded logics have been shown to be amazingly versatile and tractable logics since their inception by Andréka, van Benthem, Németi. Results to be surveyed include finite and small model properties, decidability results, complexity and expressive completeness issues, and guarded bisimulations.
Subject Classification
Keywords
- model theory
- guarded logic
- bisimulation
- hypergraphs
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads