Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Axel, Haddad"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 18, Issue 3 (2022)
Priced timed games are two-player zero-sum games played on priced timed automata (whose locations and transitions are labeled by weights modelling the cost of spending time in a state and executing an action, respectively). The goals of the players a
Externí odkaz:
https://doaj.org/article/855a3ad47a244767baac92a13811c604
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 220, Iss Proc. Cassting 2016/SynCoP'16, Pp 1-12 (2016)
Algorithms and models based on game theory have nowadays become prominent techniques for the design of digital controllers for critical systems. Indeed, such techniques enable automatic synthesis: given a model of the environment and a property that
Externí odkaz:
https://doaj.org/article/3143e466c0f94f66abad04c1f27944ee
Autor:
Axel, Haddad, Gauthier, Dodin, Gabriela, Hossu, Manuela, Perez, Pedro, Teixeira, Cécile, Rumeau, Roger, Jankowski, Romain, Gillet
Purpose: To study the anatomy of the latero-lateral joint (LLJ) between the upper lateral (ULC) and lower lateral (LLC) crus of the nasal cartilages, usually described as a scroll articulation. Methodology: Six nasal pyramids were taken in monobloc f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e4db8cb497ef5a450e4f8101a22c21c3
https://doi.org/10.21203/rs.3.rs-2010335/v1
https://doi.org/10.21203/rs.3.rs-2010335/v1
Autor:
Axel Haddad
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 77, Iss Proc. FICS 2012, Pp 23-30 (2012)
We propose a study of the modes of derivation of higher-order recursion schemes, proving that value trees obtained from schemes using innermost-outermost derivations (IO) are the same as those obtained using unrestricted derivations. Given that highe
Externí odkaz:
https://doaj.org/article/418788f5fa8449838a700268d1a85b14
Priced timed games are two-player zero-sum games played on priced timed automata (whose locations and transitions are labeled by weights modelling the cost of spending time in a state and executing an action, respectively). The goals of the players a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6cd8c91b176c77ee1e07a1502e47c680
Publikováno v:
Information and Computation. 245:17-35
In 2006, Varacca and Volzer proved that on finite graphs, ω-regular large sets coincide with ω-regular sets of probability 1, by using the existence of positional strategies in the related Banach-Mazur games. Motivated by this result, we try to und
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cdd76013aed5e750d5e4de482309a167
https://doi.org/10.1016/j.ic.2015.06.004
https://doi.org/10.1016/j.ic.2015.06.004
Publikováno v:
Acta Informatica
Acta Informatica, 2017, Special Issue: Selected papers from the 26th International Conference on Concurrency Theory (CONCUR 2015), 54 (1), pp.85--125. ⟨10.1007/s00236-016-0276-z⟩
Acta Informatica, Springer Verlag, 2017, Special Issue: Selected papers from the 26th International Conference on Concurrency Theory (CONCUR 2015), 54 (1), pp.85--125. ⟨10.1007/s00236-016-0276-z⟩
Acta Informatica, 2017, Special Issue: Selected papers from the 26th International Conference on Concurrency Theory (CONCUR 2015), 54 (1), pp.85--125. ⟨10.1007/s00236-016-0276-z⟩
Acta Informatica, Springer Verlag, 2017, Special Issue: Selected papers from the 26th International Conference on Concurrency Theory (CONCUR 2015), 54 (1), pp.85--125. ⟨10.1007/s00236-016-0276-z⟩
International audience; Quantitative games are two-player zero-sum games played on directed weighted graphs. Total-payoff games—that can be seen as a refinement of the well-studied mean-payoff games—are the variant where the payoff of a play is c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0e200acb939fcfe2e0feff248f575ac6
https://hal.science/hal-01414114/document
https://hal.science/hal-01414114/document
Publikováno v:
ACM Transactions on Computational Logic
ACM Transactions on Computational Logic, Association for Computing Machinery, 2014, 15 (3), pp.24. ⟨10.1145/2629336⟩
ACM Transactions on Computational Logic, Association for Computing Machinery, 2014, 15 (3), pp.24. ⟨10.1145/2629336⟩
We study finite automata running over infinite binary trees. A run of such an automaton over an input tree is a tree labeled by control states of the automaton: the labeling is built in a top-down fashion and should be consistent with the transitions
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8e3b82d78925a4e4864441e0033f60f1
https://doi.org/10.1145/2629336
https://doi.org/10.1145/2629336
Publikováno v:
Cassting Workshop on Games for the Synthesis of Complex Systems (Cassting'16)
Cassting Workshop on Games for the Synthesis of Complex Systems (Cassting'16), Apr 2016, Eindhoven, Netherlands. pp.1-12, ⟨10.4204/EPTCS.220.1⟩
Cassting/SynCoP
Electronic Proceedings in Theoretical Computer Science, Vol 220, Iss Proc. Cassting 2016/SynCoP'16, Pp 1-12 (2016)
Cassting Workshop on Games for the Synthesis of Complex Systems (Cassting'16), Apr 2016, Eindhoven, Netherlands. pp.1-12, ⟨10.4204/EPTCS.220.1⟩
Cassting/SynCoP
Electronic Proceedings in Theoretical Computer Science, Vol 220, Iss Proc. Cassting 2016/SynCoP'16, Pp 1-12 (2016)
Algorithms and models based on game theory have nowadays become prominent techniques for the design of digital controllers for critical systems. Indeed, such techniques enable automatic synthesis: given a model of the environment and a property that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6544e06993e7b36c0d7228d5da5fc270
https://hal.inria.fr/hal-01452611
https://hal.inria.fr/hal-01452611
Publikováno v:
ACM Transactions on Computational Logic. 16:1-2
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f0e04e742ab57021cd09951e4226045d
https://doi.org/10.1145/2824254
https://doi.org/10.1145/2824254