License
when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2010.260
URN: urn:nbn:de:0030-drops-28690
URL: http://drops.dagstuhl.de/opus/volltexte/2010/2869/
Czerwinski, Wojciech ; Lasota, Slawomir

Fast equivalence-checking for normed context-free processes

pdf-format:
Dokument 1.pdf (540 KB)

Abstract

Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time $O(n^5)$, thus improving the previously known complexity $O(n^8 * polylog(n))$. It also improves the previously known complexity $O(n^6 * polylog(n))$ of the equality problem for simple grammars.

BibTeX - Entry

@InProceedings{czerwinski_et_al:LIPIcs:2010:2869,
  author =	{Wojciech Czerwinski and Slawomir Lasota},
  title =	{{Fast equivalence-checking for normed context-free processes}},
  booktitle =	{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
  pages =	{260--271},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-23-1},
  ISSN =	{1868-8969},
  year =	{2010},
  volume =	{8},
  editor =	{Kamal Lodaya and Meena Mahajan},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2010/2869},
  URN =		{urn:nbn:de:0030-drops-28690},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2010.260},
  annote =	{Keywords: bisimulation, norm, context-free grammar, simple grammar}
}

Keywords: bisimulation, norm, context-free grammar, simple grammar
Seminar: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)
Issue date: 2010
Date of publication: 14.12.2010

DROPS-Home | Fulltext Search | Imprint Published by LZI