Zobrazeno 1 - 10
of 1 209
pro vyhledávání: '"Gastin A"'
The translation of Metric Interval Temporal Logic (MITL) to timed automata is a topic that has been extensively studied. A key challenge here is the conversion of future modalities into equivalent automata. Typical conversions equip the automata with
Externí odkaz:
http://arxiv.org/abs/2407.08452
Deterministic two-way transducers capture the class of regular functions. The efficiency of composing two-way transducers has a direct implication in algorithmic problems related to reactive synthesis, where transformation specifications are converte
Externí odkaz:
http://arxiv.org/abs/2406.11488
Publikováno v:
In LICS'24: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, ACM, 2024, Article No.: 2, Pages 1-13
We propose a local, past-oriented fragment of propositional dynamic logic to reason about concurrent scenarios modelled as Mazurkiewicz traces, and prove it to be expressively complete with respect to regular trace languages. Because of locality, spe
Externí odkaz:
http://arxiv.org/abs/2405.11308
In this paper, we consider a model of generalized timed automata (GTA) with two kinds of clocks, history and future, that can express many timed features succinctly, including timed automata, event-clock automata with and without diagonal constraints
Externí odkaz:
http://arxiv.org/abs/2305.17824
Autor:
James, Lachlan P., Davids, Charlie J., Talpey, Scott W., Huynh, Minh, Lidums, Maris, Driller, Matthew W., Kelly, Vincent G., Gastin, Paul B.
Publikováno v:
International Journal of Sports Physiology & Performance; Dec2024, Vol. 19 Issue 12, p1426-1433, 8p
Timed automata have been introduced by Rajeev Alur and David Dill in the early 90's. In the last decades, timed automata have become the de facto model for the verification of real-time systems. Algorithms for timed automata are based on the traversa
Externí odkaz:
http://arxiv.org/abs/2207.07479
Publikováno v:
Logical Methods in Computer Science, Volume 20, Issue 3 (July 2, 2024) lmcs:10408
Event-clock automata (ECA) are a well-known semantic subclass of timed automata (TA) which enjoy admirable theoretical properties, e.g., determinizability, and are practically useful to capture timed specifications. However, unlike for timed automata
Externí odkaz:
http://arxiv.org/abs/2207.02633
Publikováno v:
Jurnal Ilmu Kesehatan Masyarakat, Vol 15, Iss 2 (2024)
HIV/AIDS remains a public health crisis, HIV/AIDS remains a public health crisis, especially among male adolescents in Indonesia. This urgency stems from the rapid increase in cases among adolescents, who often lack adequate access to education and p
Externí odkaz:
https://doaj.org/article/3fd1cf13244b4490a85a75490980a747
Publikováno v:
Logical Methods in Computer Science, Vol Volume 20, Issue 3 (2024)
Event-clock automata (ECA) are a well-known semantic subclass of timed automata (TA) which enjoy admirable theoretical properties, e.g., determinizability, and are practically useful to capture timed specifications. However, unlike for timed automata
Externí odkaz:
https://doaj.org/article/4a220c457cee47d6a0ead05f896d4e31
Autor:
Slattery, Patrick, Wheat, Jon, Lizama, L. Eduardo Cofré, Gastin, Paul, Dascombe, Ben, Huynh, Minh, Middleton, Kane
Publikováno v:
In Gait & Posture October 2024 114:257-262