EDP Sciences Journals List

• All issues
• Special issues
• E-First
• Forthcoming
• News
• Search

Home Document

Subscriber Authentication Point

Journal homepage

Table of contents

 Previous article  Next article 

• Abstract
• - PDF (232.5 KB)
• - References

Services

• Same authors
  - Google Scholar
  - EDP Sciences database
• Related articles
  
  - EDP Sciences database
•  
• Recommend this article
• Download citation
• Alert me when this article is cited
• Alert me when this article is corrected

Bookmarking

• BibSonomy	CiteUlike
  Connotea	Del.icio.us
  Digg	Facebook

• EDPS account
• Email-alert

Issue		Theoret. Informatics Appl. Volume 34, Number 6, November-December 2000
Page(s)		565 - 584
DOI		10.1051/ita:2000131

DOI: 10.1051/ita:2000131
Theoret. Informatics Appl. 34 (2000) 565-584

Characteristic Formulae for Timed Automata

Luca Aceto
BRICS (Basic Research in Computer Science, Centre of the Danish National Research Foundation), Department of Computer Science, Aalborg University, Fr. Bajersvej 7E, 9220 Aalborg Ø, Denmark.

Anna Ingólfsdóttir
BRICS (Basic Research in Computer Science, Centre of the Danish National Research Foundation), Department of Computer Science, Aalborg University, Fr. Bajersvej 7E, 9220 Aalborg Ø, Denmark.

Mikkel Lykke Pedersen
BRICS (Basic Research in Computer Science, Centre of the Danish National Research Foundation), Department of Computer Science, Aalborg University, Fr. Bajersvej 7E, 9220 Aalborg Ø, Denmark.

Jan Poulsen
BRICS (Basic Research in Computer Science, Centre of the Danish National Research Foundation), Department of Computer Science, Aalborg University, Fr. Bajersvej 7E, 9220 Aalborg Ø, Denmark.

Received August 15, 2000. Accepted March 14, 2001

Abstract: This paper offers characteristic formula constructions in the real-time logic $L_{\nu}$ for several behavioural relations between (states of) timed automata. The behavioural relations studied in this work are timed (bi)similarity, timed ready simulation, faster-than bisimilarity and timed trace inclusion. The characteristic formulae delivered by our constructions have size which is linear in that of the timed automaton they logically describe. This also applies to the characteristic formula for timed bisimulation equivalence, for which an exponential space construction was previously offered by Laroussinie, Larsen and Weise.

AMS Subject Classification: 68Q60, 68Q10.

Communicated by: Z. Ésik

What is OpenURL?

The OpenURL standard is a protocol for transmission of metadata describing the resource that you wish to access. An OpenURL link containsarticle metadata and directs it to the OpenURL server of your choice. The OpenURL server can provide access to the resource and also offer complementary services (specific search engine, export of references...). The OpenURL link can be generated by different means:

• if your librarian has set up your subscription with an OpenURL resolver, OpenURL links appear automatically on the abstract pages,
• you can define your own OpenURL resolver with your EDPS Account. In this case your choice will be given priority over that of your library,
• you can use an add-on for your browser (Firefox or I.E.) to display OpenURL links on a page (see http://www.openly.com/openurlref/). You should disable this module if you wish to use the OpenURL server that you or your library have defined.

Back to top

• EDP Sciences
• Credits
• Contacts