Filter your results
- 34
- 4
- 25
- 8
- 2
- 1
- 1
- 1
- 1
- 38
- 3
- 2
- 1
- 3
- 4
- 4
- 2
- 3
- 6
- 3
- 4
- 1
- 2
- 38
- 17
- 17
- 15
- 5
- 4
- 3
- 3
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 38
- 12
- 9
- 8
- 6
- 5
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 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
38 Results
|
|
sorted by
|
|
Weighted Specifications over Nested WordsFoundations of Software Science and Computation Structures (FoSSaCS'13), Mar 2013, Rome, Italy. pp.385-400, ⟨10.1007/978-3-642-37075-5_25⟩
Conference papers
hal-00909035v1
|
||
|
Logical Characterization of Weighted Pebble Walking AutomataCSL-LICS '14, Jul 2014, Vienna, Austria. ⟨10.1145/2603088.2603118⟩
Conference papers
hal-01006125v1
|
||
Weighted Expressions and DFS Tree Automata[Research Report] LSV-11-08, 2011
Reports
hal-00779951v1
|
|||
|
Interval Iteration Algorithm for MDPs and IMDPsTheoretical Computer Science, 2018, 735, pp.111 - 131. ⟨10.1016/j.tcs.2016.12.003⟩
Journal articles
hal-01809094v1
|
||
|
Timed-Automata-Based Verification of MITL over Signals24th International Symposium on Temporal Representation and Reasoning (TIME 2017), Oct 2017, Mons, France. pp.7:1--7:19, ⟨10.4230/LIPIcs.TIME.2017.7⟩
Conference papers
hal-01526986v1
|
||
|
Bounded underapproximationsFormal Methods in System Design, 2012, 40 (2), pp.206-231. ⟨10.1007/s10703-011-0136-y⟩
Journal articles
hal-00776791v1
|
||
|
A Robust Class of Data Languages and an Application to LearningLogical Methods in Computer Science, 2014, 10 (4:19), ⟨10.2168/LMCS-10(4:19)2014⟩
Journal articles
hal-00920945v2
|
||
|
Adding Negative Prices to Priced Timed Games25th International Conference on Concurrency Theory (CONCUR'14), Sep 2014, Rome, Italy. pp.560-575, ⟨10.1007/978-3-662-44584-6_38⟩
Conference papers
hal-01273480v1
|
||
|
Optimal Reachability in Divergent Weighted Timed Games20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'17), Apr 2017, Uppsala, Sweden. pp.162-178, ⟨10.1007/978-3-662-54458-7_10⟩
Conference papers
hal-01522546v1
|
||
|
Dynamics on Games: Simulation-Based Techniques and Applications to Routing39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019), Dec 2019, Bombay, India. ⟨10.4230/LIPIcs.FSTTCS.2019.35⟩
Conference papers
hal-02414987v1
|
||
|
Determinisation of Finitely-Ambiguous Copyless Cost Register Automata44th International Symposium on Mathematical Foundations of Computer Science, Aug 2019, Aachen, Germany. ⟨10.4230/LIPIcs.MFCS.2019.75⟩
Conference papers
hal-02268107v1
|
||
|
Quantitative Games under Failures35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'15), Dec 2015, Bangalore, India. pp.293-306, ⟨10.4230/LIPIcs.FSTTCS.2015.293⟩
Conference papers
hal-01273251v1
|
||
|
Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability gamesActa 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⟩
Journal articles
hal-01414114v1
|
||
|
Reachability in MDPs: Refining Convergence of Value Iteration8th International Workshop on Reachability Problems (RP'14), Sep 2014, Oxford, United Kingdom. pp.125-137, ⟨10.1007/978-3-319-11439-2_10⟩
Conference papers
hal-01091122v2
|
||
|
Playing Stochastically in Weighted Timed Games to Emulate Memory48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Jul 2021, Glasgow (virtual), United Kingdom. ⟨10.4230/LIPIcs.ICALP.2021.137⟩
Conference papers
hal-03282049v1
|
||
|
Game Theory for Real-Time Synthesis: Decision, Approximation, and RandomnessComputer Science and Game Theory [cs.GT]. Aix-Marseille Université, 2022
Habilitation à diriger des recherches
tel-03663275v1
|
||
|
Pebble Weighted Automata and Weighted LogicsACM Transactions on Computational Logic, 2014, 15 (2), pp.15. ⟨10.1145/2579819⟩
Journal articles
hal-00964994v2
|
||
|
MightyL: A Compositional Translation from MITL to Timed Automata29th International Conference on Computer Aided Verification (CAV'17), Jul 2017, Heidelberg, Germany. pp.421-440, ⟨10.1007/978-3-319-63387-9_21⟩
Conference papers
hal-01525524v1
|
||
|
A Unifying Survey on Weighted Logics and Weighted AutomataSoft Computing, 2018, 22 (4), pp.1047-1065. ⟨10.1007/s00500-015-1952-6⟩
Journal articles
hal-01130216v2
|
||
|
Adding Pebbles to Weighted Automata: Easy Specification & Efficient EvaluationTheoretical Computer Science, 2014, 534, ⟨10.1016/j.tcs.2014.02.034⟩
Journal articles
hal-01091105v2
|
||
|
Robust Controller Synthesis in Timed Büchi Automata: A Symbolic ApproachCAV 2019 - 31st International Conference on Computer Aided Verification, Jul 2019, New-York, United States. pp.572-590, ⟨10.1007/978-3-030-25540-4_33⟩
Conference papers
hal-02264083v1
|
||
|
Efficient algorithms and tools for MITL model-checking and synthesis23rd International Conference on Engineering of Complex Computer Systems (ICECCS), Dec 2018, Melbourne, Australia
Conference papers
hal-02014073v1
|
||
|
Bounded UnderapproximationsProceedings of the 22nd International Conference on Computer Aided Verification (CAV'10), Jul 2010, Edinburgh, United Kingdom. pp.600-614, ⟨10.1007/978-3-642-14295-6_52⟩
Conference papers
hal-00608175v1
|
||
|
Specification and verification of quantitative properties : expressions, logics, and automataOther [cs.OH]. École normale supérieure de Cachan - ENS Cachan, 2013. English. ⟨NNT : 2013DENS0039⟩
Theses
tel-00957763v1
|
||
|
Efficient Energy Distribution in a Smart Grid using Multi-Player GamesCassting Workshop on Games for the Synthesis of Complex Systems (Cassting'16) , Apr 2016, Eindhoven, Netherlands. pp.1 - 12, ⟨10.4204/EPTCS.220.1⟩
Conference papers
hal-01452611v1
|
||
|
Simple Priced Timed Games Are Not That SimpleProceedings of the 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'15), Dec 2015, Bangalore, India. pp.278-292, ⟨10.4230/LIPIcs.FSTTCS.2015.p⟩
Conference papers
hal-01452621v1
|
||
|
To Reach or not to Reach? Efficient Algorithms for Total-Payoff GamesProceedings of the 26th International Conference on Concurrency Theory (CONCUR'15), Sep 2015, Madrid, Spain. pp.297-310, ⟨10.4230/LIPIcs.CONCUR.2015.297⟩
Conference papers
hal-01273475v1
|
||
|
Adding Pebbles to Weighted AutomataProceedings of the 17th International Conference on Implementation and Application of Automata (CIAA'12), 2012, Porto, Portugal. pp.28-51, ⟨10.1007/978-3-642-31606-7_4⟩
Conference papers
hal-00776603v1
|
||
|
One-Clock Priced Timed Games with Arbitrary WeightsLogical Methods in Computer Science, 2022, 18 (3), pp.51
Journal articles
hal-02424743v2
|
||
|
Real-time Synthesis is Hard!14th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS'16), Aug 2016, Québec City, Canada. pp.105-120, ⟨10.1007/978-3-319-44878-7_7⟩
Conference papers
hal-01344684v1
|
- 1
- 2