Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Jean-Francois Raskin"'
Autor:
Laurent Doyen, Jean-Francois Raskin
Publikováno v:
Logical Methods in Computer Science, Vol Volume 5, Issue 1 (2009)
We propose and evaluate antichain algorithms to solve the universality and language inclusion problems for nondeterministic Buechi automata, and the emptiness problem for alternating Buechi automata. To obtain those algorithms, we establish the exist
Externí odkaz:
https://doaj.org/article/61793ed54abd410abecfdebe3ae4ae25
Publikováno v:
Logical Methods in Computer Science, Vol Volume 3, Issue 3 (2007)
We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about the history of a play, namely, on the past sequence of observations. Su
Externí odkaz:
https://doaj.org/article/de0323cf4a0a47298041ac3c2f486374
Publikováno v:
Logical Methods in Computer Science, Vol Volume 3, Issue 1 (2007)
In this paper, we study the model-checking and parameter synthesis problems of the logic TCTL over discrete-timed automata where parameters are allowed both in the model (timed automaton) and in the property (temporal formula). Our results are as fol
Externí odkaz:
https://doaj.org/article/cb8fcbc000584832bfde28bc21be00aa
Autor:
Jean-Francois Raskin, Davide Bresolin
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 326
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2ccabdc5663da91a436c59ec16a2d424
https://doi.org/10.4204/eptcs.326.0
https://doi.org/10.4204/eptcs.326.0
This Festschrift is dedicated to Thomas A. Henzinger on the occasion of his 60th birthday in 2022. This Festschrift volume celebrates his many contributions in the field of computer science, with 31 papers covering various research and application d
Publikováno v:
Logical Methods in Computer Science, Vol Volume 19, Issue 4 (2023)
In this paper, we provide an effective characterization of all the subgame-perfect equilibria in infinite duration games played on finite graphs with mean-payoff objectives. To this end, we introduce the notion of requirement, and the notion of negot
Externí odkaz:
https://doaj.org/article/a9966ec22b0a4e1d869bf489d1c1aa3d
Decidability of the determinization problem for weighted automata over the semiring $(\mathbb{Z} \cup {-\infty}, \max, +)$, WA for short, is a long-standing open question. We propose two ways of approaching it by constraining the search space of dete
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c63bfad56f03239c27072e636cc5777b
http://arxiv.org/abs/1701.02903
http://arxiv.org/abs/1701.02903
Autor:
Marsha Chechik, Jean-François Raskin
This book constitutes the proceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2016, which took place in Eindhoven, The Netherlands, in April 2016, held as Part of the European J
Autor:
Franck Cassez, Jean-Francois Raskin
This book constitutes the proceedings of the 12th International Symposium on Automated Technology for Verification and Analysis, ATVA 2014, held in Sydney, Australia, in November 2014.The 29 revised papers presented in this volume were carefully revi
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642120015
Tools and Algorithms for the Construction and Analysis of Systems
Tools and Algorithms for the Construction and Analysis of Systems
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e1be735ae8b05a081e3a7481574e8dda
https://doi.org/10.1007/978-3-642-12002-2
https://doi.org/10.1007/978-3-642-12002-2