Filtrer vos résultats
- 34
- 7
- 24
- 7
- 5
- 4
- 1
- 41
- 1
- 2
- 5
- 7
- 3
- 5
- 2
- 2
- 1
- 2
- 3
- 2
- 3
- 1
- 1
- 1
- 40
- 1
- 20
- 13
- 12
- 4
- 4
- 4
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 41
- 7
- 6
- 5
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 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
41 résultats
|
|
|
triés par
|
|
|
Automatic Synthesis of Robust and Optimal Controllers -- An Industrial Case StudyInternational Conference on Hybrid Systems: Computation and Control (HSCC'09), Apr 2009, San Francisco, United States. pp.90--104
Communication dans un congrès
inria-00493634v1
|
||
|
|
Decision problems of tree transducers with originInformation and Computation, 2018, 261, pp.311-335. ⟨10.1016/j.ic.2018.02.011⟩
Article dans une revue
hal-02093317v1
|
||
Reachability ProblemsSpringer, 11123 (1), 2018, Theoretical Computer Science and General Issues, 978-3-030-00249-7
Ouvrages
hal-02126180v1
|
|||
|
|
Streamability of nested word transductionsLogical Methods in Computer Science, 2019
Article dans une revue
hal-02103898v1
|
||
|
|
A Generalized Twinning Property for Minimisation of Cost Register AutomataProc. 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'16), 2016, Unknown, Unknown Region. pp.857--866, ⟨10.1145/2933575.2934549⟩
Communication dans un congrès
hal-01475441v1
|
||
|
|
Weak Time Petri Nets strike back!2009
Pré-publication, Document de travail
hal-00374482v3
|
||
|
|
Robust Analysis of Timed Automata via Channel MachinesProceedings of the 11th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'08), 2008, Budapest, Hungary. pp.157-171, ⟨10.1007/978-3-540-78499-9_12⟩
Communication dans un congrès
hal-01194593v1
|
||
|
|
On the computation of the minimal coverability set of Petri nets13th International Conference on Reachability Problems, Sep 2019, Bruxelles, Belgium. ⟨10.1007/978-3-030-30806-3_13⟩
Communication dans un congrès
hal-02442611v1
|
||
|
|
Optimal and Robust Controller SynthesisFM 2018 - International Symposium on Formal Methods, Jul 2018, Oxford, United Kingdom. pp.203-221, ⟨10.1007/978-3-319-95582-7_12⟩
Communication dans un congrès
hal-01889222v1
|
||
|
|
Decision Problems of Tree Transducers with Origin42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015), Jul 2015, Kyoto, Japan. ⟨10.1007/978-3-662-47666-6_17⟩
Communication dans un congrès
hal-01285566v1
|
||
|
|
A Generalised Twinning Property for Minimisation of Cost Register Automata2015
Pré-publication, Document de travail
hal-01201704v1
|
||
|
|
Synthesis of Data Word TransducersCONCUR 2019, Aug 2019, Amsterdam, Netherlands. ⟨10.4230/LIPIcs.CONCUR.2019.24⟩
Communication dans un congrès
hal-02439660v1
|
||
|
|
On Computability of Data Word Functions Defined by TransducersFoundations of Software Science and Computation Structures - 23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings, Apr 2020, Dublin, Ireland. pp.217-236, ⟨10.1007/978-3-030-45231-5_12⟩
Communication dans un congrès
hal-02945572v1
|
||
|
|
From Two-Way to One-Way Finite State Transducers28th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2013, New Orleans, United States. pp.468-477, ⟨10.1109/LICS.2013.53⟩
Communication dans un congrès
hal-00946161v1
|
||
|
|
Robustness of Time Petri Nets under Guard EnlargementFundamenta Informaticae, 2016, 143 (3-4), ⟨10.3233/FI-2016-1312⟩
Article dans une revue
hal-01379431v1
|
||
|
|
Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness2012
Rapport
hal-00697091v1
|
||
|
|
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⟩
Communication dans un congrès
hal-02264083v1
|
||
|
|
Sequentiality of String-to-Context Transducers46th International Colloquium on Automata, Languages, and Programming, Jul 2019, Patras, Greece. ⟨10.4230/LIPIcs.ICALP.2019.123⟩
Communication dans un congrès
hal-02436585v1
|
||
|
|
Aperiodic String TransducersInternational Journal of Foundations of Computer Science, 2018
Article dans une revue
hal-02003676v1
|
||
|
|
Probabilistic Robust Timed Games2014
Rapport
hal-01010813v1
|
||
|
|
Properties of Visibly Pushdown Transducers35th International Symposium on Mathematical Foundations of Computer Science, Aug 2010, Brno, Czech Republic
Communication dans un congrès
inria-00492241v2
|
||
|
|
Two-Way Visibly Pushdown Automata and TransducersProc. 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'16), 2016, Unknown, Unknown Region. pp.217--226, ⟨10.1145/2933575.2935315⟩
Communication dans un congrès
hal-01475442v1
|
||
|
|
Introduire les enjeux environnementaux et sociétaux du numérique en L3 informatique1024 : Bulletin de la Société Informatique de France, 2023, 21, pp.83 - 92. ⟨10.48556/SIF.1024.21.83⟩
Article dans une revue
hal-04059073v1
|
||
|
|
Symbolic Approximation of Weighted Timed Games38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018), Dec 2018, Ahmedabad, India. ⟨10.4230/LIPIcs.FSTTCS.2018.28⟩
Communication dans un congrès
hal-02014051v1
|
||
|
|
Degree of sequentiality of weighted automata20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2017), Apr 2017, Uppsala, Sweden
Communication dans un congrès
hal-01782446v1
|
||
|
|
Reaching Your Goal Optimally by Playing at Random with No Memory31st International Conference on Concurrency Theory (CONCUR 2020), 2020, Vienna, Austria. ⟨10.4230/LIPIcs.CONCUR.2020.26⟩
Communication dans un congrès
hal-02925540v1
|
||
|
|
From Two-Way Transducers to Regular Function Expressions22nd International Conference on Developments in Language Theory (DLT 2018), Sep 2018, Tokyo, Japan. pp.96-108, ⟨10.1007/978-3-319-98654-8_8⟩
Communication dans un congrès
hal-02003430v1
|
||
|
|
Streamability of Nested Word TransductionsFSTTCS - 31st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science - 2011, Dec 2011, Mumbai, India. pp.312-324, ⟨10.4230/LIPIcs.FSTTCS.2011.312⟩
Communication dans un congrès
inria-00566409v2
|
||
|
|
Robust Model-Checking of Linear-Time Properties in Timed AutomataProceedings of the 7th Latin American Symposium on Theoretical Informatics (LATIN'06), 2006, Valdivia, Chile. pp.238-249, ⟨10.1007/11682462_25⟩
Communication dans un congrès
hal-01194610v1
|
||
|
|
A polynomial procedure for trimming visibly pushdown automata2011
Rapport
hal-00606778v2
|
- 1
- 2