Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Aldric Degorre"'
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031158384
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f84f1d48a60db43c0011cffd0bd08658
https://doi.org/10.1007/978-3-031-15839-1_4
https://doi.org/10.1007/978-3-031-15839-1_4
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030001506
FORMATS
FORMATS
We introduce and study a new (pseudo) metric on timed words having several advantages: it is global: it applies to words having different number of events; it is realistic and takes into account imprecise observation of timed events; thus it reflects
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7545e2076c7cb445f2ad83f876b53925
https://doi.org/10.1007/978-3-030-00151-3_12
https://doi.org/10.1007/978-3-030-00151-3_12
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642402289
FORMATS
FORMATS 2013
FORMATS 2013, Aug 2013, Argentina. pp.16-30, ⟨10.1007/978-3-642-40229-6_2⟩
FORMATS
FORMATS 2013
FORMATS 2013, Aug 2013, Argentina. pp.16-30, ⟨10.1007/978-3-642-40229-6_2⟩
International audience; Various problems about probabilistic and non-probabilistic timed automata (computing probability density, language volume or entropy) can be naturally phrased as iteration of linear operators in Banach spaces. Convergence of s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d3431710f71eb39e27d3dfd0051aa3c6
https://ora.ox.ac.uk/objects/uuid:dbc9624d-3556-4d1c-9e5e-c63622fc1042
https://ora.ox.ac.uk/objects/uuid:dbc9624d-3556-4d1c-9e5e-c63622fc1042
Publikováno v:
HAL
Two intimately related new classes of games are introduced and studied: entropy games (EGs) and matrix multiplication games (MMGs). An EG is played on a finite arena by two-and-a-half players: Despot, Tribune and the non-deterministic People. Despot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2aa4500a6b2d168da5701d9a798b3881
https://hal.archives-ouvertes.fr/hal-01164086v3/document
https://hal.archives-ouvertes.fr/hal-01164086v3/document
Publikováno v:
CoRR
CoRR, 2015, abs/1506.04885
BASE-Bielefeld Academic Search Engine
HAL
CoRR, 2015, abs/1506.04885
BASE-Bielefeld Academic Search Engine
HAL
International audience; no abstract
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::463568d89c9dd0b5b303787227653546
https://hal.archives-ouvertes.fr/hal-01699930
https://hal.archives-ouvertes.fr/hal-01699930
Publikováno v:
HAL
To study the size of regular timed languages, we generalize a classical approach introduced by Chomsky and Miller for discrete automata: count words having n symbols, and compute the exponential growth rate of their number (entropy). For timed automa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ec6479fb3bb4266df41112f5a1dac10e
https://hal.archives-ouvertes.fr/hal-01078613
https://hal.archives-ouvertes.fr/hal-01078613
Publikováno v:
Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14-18, 2014
Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14-18, 2014, 2014, Unknown, Unknown Region. pp.10:1--10:9, ⟨10.1145/2603088.2603158⟩
CSL-LICS
Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14-18, 2014, 2014, Unknown, Unknown Region. pp.10:1--10:9, ⟨10.1145/2603088.2603158⟩
CSL-LICS
We study the "approximability" of unbounded temporal operators with time-bounded operators, as soon as some time bounds tend to ∞. More specifically, for formulas in the fragments PLTL⋄ and PLTL◻ of the Parametric Linear Temporal Logic of Alur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6912f7e2507506a9e35c56a0c018f98c
https://hal.archives-ouvertes.fr/hal-01699933
https://hal.archives-ouvertes.fr/hal-01699933
Publikováno v:
37th International Symposium on Mathematical Foundations of Computer Science
MFCS 2012
MFCS 2012, Aug 2012, Bratislava, Slovakia. pp.124-135, ⟨10.1007/978-3-642-32589-2_14⟩
Mathematical Foundations of Computer Science 2012 ISBN: 9783642325885
MFCS
MFCS 2012
MFCS 2012, Aug 2012, Bratislava, Slovakia. pp.124-135, ⟨10.1007/978-3-642-32589-2_14⟩
Mathematical Foundations of Computer Science 2012 ISBN: 9783642325885
MFCS
In order to study precisely the growth of timed languages, we associate to such a language a generating function. These functions (tightly related to volume and entropy of timed languages) satisfy compositionality properties and, for deterministic ti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::74b91d45b0c115637fcf9753d6b370ea
https://hal.archives-ouvertes.fr/hal-00678443
https://hal.archives-ouvertes.fr/hal-00678443
Publikováno v:
FORMATS
FORMATS, 2012, United Kingdom. pp.27-42, ⟨10.1007/978-3-642-33365-1_4⟩
Lecture Notes in Computer Science ISBN: 9783642333644
FORMATS, 2012, United Kingdom. pp.27-42, ⟨10.1007/978-3-642-33365-1_4⟩
Lecture Notes in Computer Science ISBN: 9783642333644
International audience; The classical theory of constrained-channel coding deals with the following questions: given two languages representing a source and a channel, is it possible to encode source messages to channel messages, and how to realize e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::de6935bfc9d64ff4decfdb2634f00e9a
https://hal-upec-upem.archives-ouvertes.fr/hal-00793143/document
https://hal-upec-upem.archives-ouvertes.fr/hal-00793143/document
Publikováno v:
Computer Science Logic ISBN: 9783642152047
CSL
CSL
We consider two-player games with imperfect information and quantitative objective. The game is played on a weighted graph with a state space partitioned into classes of indistinguishable states, giving players partial knowledge of the state. In an e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::62ee5dcb1bf4b9b6829a5dcbdcb699a6
https://doi.org/10.1007/978-3-642-15205-4_22
https://doi.org/10.1007/978-3-642-15205-4_22