Efficient on-the-fly algorithms for partially observable timed games

Franck Cassez

doi:10.1007/978-3-540-75454-1_3

Efficient on-the-fly algorithms for partially observable timed games

Franck Cassez^*

^*Corresponding author for this work

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

10 Citations (Scopus)

Abstract

In this paper, we review some recent results on the efficient synthesis of controllers for timed systems. We first recall the basics of controller synthesis for timed games and then present an efficient on-the-fiy algorithm for reachability games and its extension to partially observable timed games. The material of this paper is based on two recent articles [13,14] that introduced truly on-the-fly algorithms for the synthesis of controllers for timed games. These results were obtained together with Alexandre David, Emmanuel Fleury and Kim G. Larsen (Aalborg University, Denmark), Didier Lime (IRCCyN, France) and Jean-François Raskin (ULB, Brussels, Belgium).

Original language	English
Title of host publication	Formal Modeling and Analysis of Timed Systems - 5th International Conference, FORMATS 2007, Proceedings
Place of Publication	Berlin; New York
Publisher	Springer, Springer Nature
Pages	5-24
Number of pages	20
Volume	4763 LNCS
ISBN (Electronic)	9783540754541
ISBN (Print)	9783540754534
DOIs	https://doi.org/10.1007/978-3-540-75454-1_3
Publication status	Published - 2007
Externally published	Yes
Event	5th International Conference on Formal Modelling and Analysis of Timed Systems, FORMATS 2007 - Salzburg, Austria Duration: 3 Oct 2007 → 5 Oct 2007

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4763 LNCS
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Other

Other	5th International Conference on Formal Modelling and Analysis of Timed Systems, FORMATS 2007
Country	Austria
City	Salzburg
Period	3/10/07 → 5/10/07

Access to Document

10.1007/978-3-540-75454-1_3

Link to publication in Scopus

Fingerprint Dive into the research topics of 'Efficient on-the-fly algorithms for partially observable timed games'. Together they form a unique fingerprint.

Cite this

Cassez, F. (2007). Efficient on-the-fly algorithms for partially observable timed games. In Formal Modeling and Analysis of Timed Systems - 5th International Conference, FORMATS 2007, Proceedings (Vol. 4763 LNCS, pp. 5-24). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4763 LNCS). Springer, Springer Nature. https://doi.org/10.1007/978-3-540-75454-1_3

Cassez, Franck. / Efficient on-the-fly algorithms for partially observable timed games. Formal Modeling and Analysis of Timed Systems - 5th International Conference, FORMATS 2007, Proceedings. Vol. 4763 LNCS Berlin; New York : Springer, Springer Nature, 2007. pp. 5-24 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{0f41ce210f674168bbd1df71adccaea9,

title = "Efficient on-the-fly algorithms for partially observable timed games",

abstract = "In this paper, we review some recent results on the efficient synthesis of controllers for timed systems. We first recall the basics of controller synthesis for timed games and then present an efficient on-the-fiy algorithm for reachability games and its extension to partially observable timed games. The material of this paper is based on two recent articles [13,14] that introduced truly on-the-fly algorithms for the synthesis of controllers for timed games. These results were obtained together with Alexandre David, Emmanuel Fleury and Kim G. Larsen (Aalborg University, Denmark), Didier Lime (IRCCyN, France) and Jean-Fran{\c c}ois Raskin (ULB, Brussels, Belgium).",

author = "Franck Cassez",

year = "2007",

doi = "10.1007/978-3-540-75454-1_3",

language = "English",

isbn = "9783540754534",

volume = "4763 LNCS",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer, Springer Nature",

pages = "5--24",

booktitle = "Formal Modeling and Analysis of Timed Systems - 5th International Conference, FORMATS 2007, Proceedings",

address = "United States",

note = "5th International Conference on Formal Modelling and Analysis of Timed Systems, FORMATS 2007 ; Conference date: 03-10-2007 Through 05-10-2007",

}

Cassez, F 2007, Efficient on-the-fly algorithms for partially observable timed games. in Formal Modeling and Analysis of Timed Systems - 5th International Conference, FORMATS 2007, Proceedings. vol. 4763 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4763 LNCS, Springer, Springer Nature, Berlin; New York, pp. 5-24, 5th International Conference on Formal Modelling and Analysis of Timed Systems, FORMATS 2007, Salzburg, Austria, 3/10/07. https://doi.org/10.1007/978-3-540-75454-1_3

Efficient on-the-fly algorithms for partially observable timed games. / Cassez, Franck.

Formal Modeling and Analysis of Timed Systems - 5th International Conference, FORMATS 2007, Proceedings. Vol. 4763 LNCS Berlin; New York : Springer, Springer Nature, 2007. p. 5-24 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4763 LNCS).

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

TY - GEN

T1 - Efficient on-the-fly algorithms for partially observable timed games

AU - Cassez, Franck

PY - 2007

Y1 - 2007

N2 - In this paper, we review some recent results on the efficient synthesis of controllers for timed systems. We first recall the basics of controller synthesis for timed games and then present an efficient on-the-fiy algorithm for reachability games and its extension to partially observable timed games. The material of this paper is based on two recent articles [13,14] that introduced truly on-the-fly algorithms for the synthesis of controllers for timed games. These results were obtained together with Alexandre David, Emmanuel Fleury and Kim G. Larsen (Aalborg University, Denmark), Didier Lime (IRCCyN, France) and Jean-François Raskin (ULB, Brussels, Belgium).

AB - In this paper, we review some recent results on the efficient synthesis of controllers for timed systems. We first recall the basics of controller synthesis for timed games and then present an efficient on-the-fiy algorithm for reachability games and its extension to partially observable timed games. The material of this paper is based on two recent articles [13,14] that introduced truly on-the-fly algorithms for the synthesis of controllers for timed games. These results were obtained together with Alexandre David, Emmanuel Fleury and Kim G. Larsen (Aalborg University, Denmark), Didier Lime (IRCCyN, France) and Jean-François Raskin (ULB, Brussels, Belgium).

UR - http://www.scopus.com/inward/record.url?scp=38149091017&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-75454-1_3

DO - 10.1007/978-3-540-75454-1_3

M3 - Conference proceeding contribution

AN - SCOPUS:38149091017

SN - 9783540754534

VL - 4763 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 5

EP - 24

BT - Formal Modeling and Analysis of Timed Systems - 5th International Conference, FORMATS 2007, Proceedings

PB - Springer, Springer Nature

CY - Berlin; New York

T2 - 5th International Conference on Formal Modelling and Analysis of Timed Systems, FORMATS 2007

Y2 - 3 October 2007 through 5 October 2007

ER -

Cassez F. Efficient on-the-fly algorithms for partially observable timed games. In Formal Modeling and Analysis of Timed Systems - 5th International Conference, FORMATS 2007, Proceedings. Vol. 4763 LNCS. Berlin; New York: Springer, Springer Nature. 2007. p. 5-24. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-75454-1_3