License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2011.2
URN: urn:nbn:de:0030-drops-32163
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2011/3216/
Go to the corresponding LIPIcs Volume Portal

Otto, Martin

The Freedoms of Guarded Bisimulation

pdf-format:
3.pdf (0.2 MB)

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.

BibTeX - Entry

@InProceedings{otto:LIPIcs:2011:3216,
  author =	{Martin Otto},
  title =	{{The Freedoms of Guarded Bisimulation}},
  booktitle =	{Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
  pages =	{2--2},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-32-3},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{12},
  editor =	{Marc Bezem},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2011/3216},
  URN =		{urn:nbn:de:0030-drops-32163},
  doi =		{10.4230/LIPIcs.CSL.2011.2},
  annote =	{Keywords: model theory, guarded logic,  bisimulation, hypergraphs}
}

Keywords: model theory, guarded logic, bisimulation, hypergraphs
Collection: Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL
Issue Date: 2011
Date of publication: 31.08.2011

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI