Tightening the exchange rates between automata

Orna Kupferman*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

Automata on infinite objects were the key to the solution of several fundamental decision problems in mathematics and logic. Today, automata on infinite objects are used for formal specification and verification of reactive systems. The practical importance of automata in formal methods has motivated a re-examination of the blow up that translations among different types of automata involve. For most translations, the situation is satisfying, in the sense that even if there is a gap between the upper and the lower bound, it is small. For some highly practical cases, however, the gap between the upper and the lower bound is exponential or even larger. The article surveys several such frustrating cases, studies features that they share, and describes recent efforts (with partial success) to close the gaps.

Original languageEnglish
Title of host publicationComputer Science Logic - 21st International Workshop, CSL 2007 and 16th Annual Conference of the EACSL, Proceedings
PublisherSpringer Verlag
Pages7-22
Number of pages16
ISBN (Print)9783540749141
DOIs
StatePublished - 2007
Event21st International Workshop on Computer Science Logic, CSL 2007 and 16th Annual Conference of the European Association for Computer Science Logic, EACSL - Lausanne, Switzerland
Duration: 11 Sep 200715 Sep 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4646 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference21st International Workshop on Computer Science Logic, CSL 2007 and 16th Annual Conference of the European Association for Computer Science Logic, EACSL
Country/TerritorySwitzerland
CityLausanne
Period11/09/0715/09/07

Fingerprint

Dive into the research topics of 'Tightening the exchange rates between automata'. Together they form a unique fingerprint.

Cite this