The Power of Reachability Testing for Timed Automata

Luca Aceto; Patricia Bouyer; Augusto Burgueño; Kim G. Larsen

doi:10.1007/978-3-540-49382-2_22

The Power of Reachability Testing for Timed Automata

Luca Aceto, Patricia Bouyer, Augusto Burgueño, Kim G. Larsen

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

27 Citations (Scopus)

Abstract

In this paper we provide a complete characterization of the class of properties of (networks of) timed automata for which model checking can be reduced to reachability checking in the context of testing automata.

Original language	English
Title of host publication	Foundations of Software Technology and Theoretical Computer Science
Subtitle of host publication	18th Conference, Chennai, India, December 17-19, 1998, Proceedings
Editors	Vikraman Arvind, Sundar Ramanujam
Place of Publication	Berlin, Heidelberg
Publisher	Springer
Pages	245–256
ISBN (Electronic)	978-3-540-49382-2
ISBN (Print)	978-3-540-65384-4
DOIs	https://doi.org/10.1007/978-3-540-49382-2_22
Publication status	Published - 2002
Externally published	Yes
Event	18th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 1998 - Chennai, India Duration: 17 Dec 1998 → 19 Dec 1998 Conference number: 18

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	1530
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	18th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 1998
Abbreviated title	FSTTCS
Country/Territory	India
City	Chennai
Period	17/12/98 → 19/12/98

Keywords

n/a OA procedure

Access to Document

10.1007/978-3-540-49382-2_22

Cite this

Aceto, L., Bouyer, P., Burgueño, A., & Larsen, K. G. (2002). The Power of Reachability Testing for Timed Automata. In V. Arvind, & S. Ramanujam (Eds.), Foundations of Software Technology and Theoretical Computer Science: 18th Conference, Chennai, India, December 17-19, 1998, Proceedings (pp. 245–256). (Lecture Notes in Computer Science ; Vol. 1530). Springer. https://doi.org/10.1007/978-3-540-49382-2_22

Aceto, Luca ; Bouyer, Patricia ; Burgueño, Augusto et al. / The Power of Reachability Testing for Timed Automata. Foundations of Software Technology and Theoretical Computer Science: 18th Conference, Chennai, India, December 17-19, 1998, Proceedings. editor / Vikraman Arvind ; Sundar Ramanujam. Berlin, Heidelberg : Springer, 2002. pp. 245–256 (Lecture Notes in Computer Science ).

@inproceedings{3833b4a1b3124ba18783665d1be84f26,

title = "The Power of Reachability Testing for Timed Automata",

abstract = "In this paper we provide a complete characterization of the class of properties of (networks of) timed automata for which model checking can be reduced to reachability checking in the context of testing automata.",

keywords = "n/a OA procedure",

author = "Luca Aceto and Patricia Bouyer and Augusto Burgue{\~n}o and Larsen, {Kim G.}",

year = "2002",

doi = "10.1007/978-3-540-49382-2_22",

language = "English",

isbn = "978-3-540-65384-4",

series = "Lecture Notes in Computer Science ",

publisher = "Springer",

pages = "245–256",

editor = "Vikraman Arvind and Sundar Ramanujam",

booktitle = "Foundations of Software Technology and Theoretical Computer Science",

address = "Germany",

note = "18th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 1998, FSTTCS ; Conference date: 17-12-1998 Through 19-12-1998",

}

Aceto, L, Bouyer, P, Burgueño, A & Larsen, KG 2002, The Power of Reachability Testing for Timed Automata. in V Arvind & S Ramanujam (eds), Foundations of Software Technology and Theoretical Computer Science: 18th Conference, Chennai, India, December 17-19, 1998, Proceedings. Lecture Notes in Computer Science , vol. 1530, Springer, Berlin, Heidelberg, pp. 245–256, 18th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 1998, Chennai, India, 17/12/98. https://doi.org/10.1007/978-3-540-49382-2_22

The Power of Reachability Testing for Timed Automata. / Aceto, Luca; Bouyer, Patricia; Burgueño, Augusto et al.
Foundations of Software Technology and Theoretical Computer Science: 18th Conference, Chennai, India, December 17-19, 1998, Proceedings. ed. / Vikraman Arvind; Sundar Ramanujam. Berlin, Heidelberg: Springer, 2002. p. 245–256 (Lecture Notes in Computer Science ; Vol. 1530).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - The Power of Reachability Testing for Timed Automata

AU - Aceto, Luca

AU - Bouyer, Patricia

AU - Burgueño, Augusto

AU - Larsen, Kim G.

N1 - Conference code: 18

PY - 2002

Y1 - 2002

N2 - In this paper we provide a complete characterization of the class of properties of (networks of) timed automata for which model checking can be reduced to reachability checking in the context of testing automata.

AB - In this paper we provide a complete characterization of the class of properties of (networks of) timed automata for which model checking can be reduced to reachability checking in the context of testing automata.

KW - n/a OA procedure

U2 - 10.1007/978-3-540-49382-2_22

DO - 10.1007/978-3-540-49382-2_22

M3 - Conference contribution

SN - 978-3-540-65384-4

T3 - Lecture Notes in Computer Science

SP - 245

EP - 256

BT - Foundations of Software Technology and Theoretical Computer Science

A2 - Arvind, Vikraman

A2 - Ramanujam, Sundar

PB - Springer

CY - Berlin, Heidelberg

T2 - 18th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 1998

Y2 - 17 December 1998 through 19 December 1998

ER -

Aceto L, Bouyer P, Burgueño A, Larsen KG. The Power of Reachability Testing for Timed Automata. In Arvind V, Ramanujam S, editors, Foundations of Software Technology and Theoretical Computer Science: 18th Conference, Chennai, India, December 17-19, 1998, Proceedings. Berlin, Heidelberg: Springer. 2002. p. 245–256. (Lecture Notes in Computer Science ). doi: 10.1007/978-3-540-49382-2_22

The Power of Reachability Testing for Timed Automata

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this