One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit

SE Verwer; MM de Weerdt; C Witteveen

One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit

Data-Intensive Systems

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

10 Citations (Scopus)

Original language	Undefined/Unknown
Title of host publication	Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings
Editors	AH Dediu, AM Ionescu, C Martin-Vide
Place of Publication	Berlin
Publisher	Springer
Pages	740-751
Number of pages	12
ISBN (Print)	978-3-642-00981-5
Publication status	Published - 2009
Event	LATA 2009 - Berlin Duration: 2 Apr 2009 → 8 Apr 2009

Publication series

Name
Publisher	Springer

Name	Lecture Notes in Computer Science
Volume	5457
ISSN (Print)	0302-9743

Conference

Conference	LATA 2009
Period	2/04/09 → 8/04/09

Keywords

CWTS JFIS < 0.75

Cite this

@inproceedings{254057a3c6704933bff352f1955990a0,

title = "One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit",

keywords = "CWTS JFIS < 0.75",

author = "SE Verwer and {de Weerdt}, MM and C Witteveen",

year = "2009",

language = "Undefined/Unknown",

isbn = "978-3-642-00981-5",

publisher = "Springer",

pages = "740--751",

editor = "AH Dediu and AM Ionescu and C Martin-Vide",

booktitle = "Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings",

note = "LATA 2009 ; Conference date: 02-04-2009 Through 08-04-2009",

}

One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit. / Verwer, SE ; de Weerdt, MM ; Witteveen, C.
Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings. ed. / AH Dediu; AM Ionescu; C Martin-Vide. Berlin: Springer, 2009. p. 740-751 (Lecture Notes in Computer Science; Vol. 5457).

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

TY - GEN

T1 - One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit

AU - Verwer, SE

AU - de Weerdt, MM

AU - Witteveen, C

PY - 2009

Y1 - 2009

KW - CWTS JFIS < 0.75

UR - http://www.springerlink.com/content/183jm7372tu706w8/

M3 - Conference contribution

SN - 978-3-642-00981-5

SP - 740

EP - 751

BT - Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings

A2 - Dediu, AH

A2 - Ionescu, AM

A2 - Martin-Vide, C

PB - Springer

CY - Berlin

T2 - LATA 2009

Y2 - 2 April 2009 through 8 April 2009

ER -

One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit

Publication series

Conference

Keywords

Other files and links

Cite this