Filtrer vos résultats
- 56
- 37
- 60
- 21
- 4
- 3
- 2
- 2
- 1
- 2
- 88
- 1
- 1
- 6
- 11
- 6
- 5
- 8
- 9
- 10
- 3
- 2
- 4
- 2
- 1
- 1
- 7
- 4
- 4
- 4
- 2
- 1
- 2
- 90
- 3
- 64
- 37
- 33
- 24
- 11
- 9
- 9
- 8
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 93
- 41
- 12
- 11
- 9
- 9
- 7
- 6
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
93 résultats
|
|
Synthesizing safe coalition strategiesFSTTCS'20, Dec 2020, on line, India
Communication dans un congrès
hal-02917538v1
|
||
|
|
Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite GraphsTheoretiCS, 2023, Volume 2, ⟨10.46298/theoretics.23.1⟩
Article dans une revue
hal-04236233v1
|
||
|
|
Timed-Automata Abstraction of Switched Dynamical Systems Using Control FunnelsFormal Modeling and Analysis of Timed Systems, 9268, Springer International Publishing, pp.60 - 75, 2015, Lecture Notes in Computer Science, 978-3-319-22974-4. ⟨10.1007/978-3-319-22975-1_5⟩
Chapitre d'ouvrage
hal-01395104v1
|
||
|
|
On the Expressiveness of TPTL and~MTLProceedings of the 25th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'05), 2005, Hyderabad, India. pp.432-443, ⟨10.1007/11590156_35⟩
Communication dans un congrès
hal-01194615v1
|
||
|
|
Stochastic timed automataLogical Methods in Computer Science, 2014, 10 (4), ⟨10.2168/LMCS-10(4:6)2014⟩
Article dans une revue
hal-01102368v1
|
||
|
|
Synthesis in presence of dynamic linksInformation and Computation, 2022, 289 (Part B), pp.104856. ⟨10.1016/j.ic.2021.104856⟩
Article dans une revue
hal-03518879v1
|
||
|
|
On Expressiveness and Complexity in Real-time Model CheckingProceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP'08)~― Part~II, 2008, Reykjavik, Iceland. pp.124-135, ⟨10.1007/978-3-540-70583-3_11⟩
Communication dans un congrès
hal-01194597v1
|
||
|
|
Analysing Decisive Stochastic Processes43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), 2016, Rome, Italy. pp.101:1-101:14, ⟨10.4230/LIPIcs.ICALP.2016.101⟩
Communication dans un congrès
hal-01397794v1
|
||
|
|
Infinite Runs in Weighted Timed Automata with Energy ConstraintsProceedings of the 6th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'08), 2008, Saint-Malo, France. pp.33-47, ⟨10.1007/978-3-540-85778-5_4⟩
Communication dans un congrès
hal-01194594v1
|
||
Timed automataHandbook of Automata Theory, European Mathematical Society Publishing House, 2021
Chapitre d'ouvrage
hal-03654382v1
|
|||
|
|
Updatable Timed AutomataTheoretical Computer Science, 2004, 321 (2-3), pp.291-345. ⟨10.1016/j.tcs.2004.04.003⟩
Article dans une revue
hal-00350196v1
|
||
|
|
Concurrent parameterized gamesFSTTCS 2019 - 39th IARCS Annual Conference on. Foundations of Software Technology and Theoretical Computer Science, Dec 2019, Bombay, India. pp.1-15
Communication dans un congrès
hal-02351236v1
|
||
|
|
Games Where You Can Play Optimally with Arena-Independent Finite Memory31st International Conference on Concurrency Theory (CONCUR'20), Sep 2020, Vienna, Austria. ⟨10.4230/LIPIcs.CONCUR.2020.18⟩
Communication dans un congrès
hal-02917552v1
|
||
|
|
Reconfiguration and message losses in parameterized broadcast networksCONCUR 2019 - 30th International Conference on Concurrency Theory, Aug 2019, Amsterdam, Netherlands. pp.1 - 15, ⟨10.4230/LIPIcs.CONCUR.2019.32⟩
Communication dans un congrès
hal-02191382v1
|
||
|
|
Quantitative analysis of real-time systems using priced timed automataCommunications of the ACM, 2011, 54 (9), pp.78-87. ⟨10.1145/1995376.1995396⟩
Article dans une revue
hal-01088030v1
|
||
|
|
Arena-Independent Finite-Memory Determinacy in Stochastic GamesCONCUR'21, Aug 2021, Paris, France. ⟨10.4230/LIPIcs.CONCUR.2021.26⟩
Communication dans un congrès
hal-03240080v1
|
||
|
|
Expressiveness of Updatable Timed Automata25th International Symposium of Mathematical Foundation of Computer Science (MFCS'2000), 2000, Bratislava, Slovakia. pp.232-242, ⟨10.1007/3-540-44612-5_19⟩
Communication dans un congrès
hal-00350490v1
|
||
|
|
Reasoning about Quality and Fuzziness of Strategic BehaviorsACM Transactions on Computational Logic, 2023, 24 (3), pp.1-38. ⟨10.1145/3582498⟩
Article dans une revue
hal-04219131v1
|
||
|
|
How to Play Optimally for Regular Objectives?ICALP'23, Jul 2023, Paderborn, Germany. pp.118:1-118:18, ⟨10.4230/LIPIcs.ICALP.2023.118⟩
Communication dans un congrès
hal-04175971v1
|
||
|
|
From Local to Global Determinacy in Concurrent Graph GamesFSTTCS'21, Dec 2021, on line, India. ⟨10.4230/LIPIcs.FSTTCS.2021.41⟩
Communication dans un congrès
hal-03641392v1
|
||
|
|
Playing (Almost-)Optimally in Concurrent Büchi and Co-Büchi GamesFSTTCS'22, Dec 2022, Chennai (India), France. pp.33:1--33:18, ⟨10.4230/LIPIcs.FSTTCS.2022.33⟩
Communication dans un congrès
hal-04236264v1
|
||
|
|
When are stochastic transition systems tameable?Journal of Logical and Algebraic Methods in Programming, 2018, 99, pp.41-96. ⟨10.1016/j.jlamp.2018.03.004⟩
Article dans une revue
hal-01938135v1
|
||
|
|
Synthesis in Presence of Dynamic LinksGandALF'20 - 11th International Symposium on Games, Automata, Logics, and Formal Verification, Sep 2020, Brussels (online), Belgium
Communication dans un congrès
hal-02917542v1
|
||
|
|
Dynamic Complexity of the Dyck Reachability20th International Conference, Foundations of Software Science and Computation Structures 2017, Apr 2017, Uppsala, Sweden. ⟨10.1007/978-3-662-54458-7⟩
Communication dans un congrès
hal-01615264v1
|
||
|
|
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics.5th International Conference on the Quantitative Evaluation of Systems (QEST'08), Sep 2008, Saint Malo, France. pp.55-64, ⟨10.1109/QEST.2008.19⟩
Communication dans un congrès
inria-00424518v1
|
||
|
|
On Termination for Faulty Channel MachinesSTACS 2008, Feb 2008, Bordeaux, France. pp.121-132
Communication dans un congrès
hal-00220515v1
|
||
|
|
Lower-Bound Constrained Runs in Weighted Timed AutomataPerformance Evaluation, 2014, 73, pp.91-109. ⟨10.1016/j.peva.2013.11.002⟩
Article dans une revue
hal-01016100v1
|
||
|
|
Model Checking One-clock Priced Timed AutomataLogical Methods in Computer Science, 2008, 4 (2:9), ⟨10.2168/LMCS-4(2:9)2008⟩
Article dans une revue
hal-01194599v1
|
||
|
|
Improved Undecidability Results on Weighted Timed AutomataInformation Processing Letters, 2006, 98 (5), pp.188-194. ⟨10.1016/j.ipl.2006.01.012⟩
Article dans une revue
hal-01194609v1
|
||
|
|
Decisiveness of Stochastic Systems and its Application to Hybrid Models11th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'20), Sep 2020, Brussels, Belgium
Communication dans un congrès
hal-02917546v1
|