Filtrer vos résultats
- 18
- 7
- 15
- 5
- 3
- 2
- 2
- 23
- 1
- 1
- 2
- 2
- 1
- 3
- 1
- 3
- 3
- 1
- 4
- 2
- 1
- 1
- 25
- 12
- 9
- 6
- 5
- 4
- 4
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 25
- 8
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
25 résultats
|
|
|
triés par
|
|
|
On the Complexity of Verifying Regular Properties on Flat Counter Systems,Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013,, Jul 2013, Riga, Latvia. pp.162-173, ⟨10.1007/978-3-642-39212-2_17⟩
Communication dans un congrès
hal-03201533v1
|
||
|
|
The Complexity of Flat Freeze LTLLogical Methods in Computer Science, 2019, 15 (3), ⟨10.23638/LMCS-15(3:33)2019⟩
Article dans une revue
hal-02398193v1
|
||
|
|
Parameterized verification of algorithms for oblivious robots on a ringFormal Methods in System Design, 2020, 56, pp.55-89. ⟨10.1007/s10703-019-00335-y⟩
Article dans une revue
hal-02290400v1
|
||
On the Decidability Status of Reachability and Coverability in Graph Transformation SystemsRTA - 23rd International Conference on Rewriting Techniques and Applications - 2012, 2012, Nagoya, Japan. pp.101-116, ⟨10.4230/LIPIcs.RTA.2012.101⟩
Communication dans un congrès
hal-00752446v1
|
|||
|
|
Weak Time Petri Nets strike back!2009
Pré-publication, Document de travail
hal-00374482v3
|
||
|
|
Equivalence Between Model-Checking Flat Counter Systems and Presburger ArithmeticReachability Problems - 8th International Workshop, RP 2014, Oxford, Joël Ouaknine; Igor Potapov; James Worrell, Sep 2014, Oxford, United Kingdom. pp.85-97, ⟨10.1007/978-3-319-11439-2_7⟩
Communication dans un congrès
hal-03201531v1
|
||
|
|
Taming Past LTL and Flat Counter SystemsInformation and Computation, 2015, 242, pp.306-339. ⟨10.1016/j.ic.2015.03.007⟩
Article dans une revue
hal-03192199v1
|
||
|
|
Deciding the Existence of Cut-Off in Parameterized Rendez-Vous Networks31st International Conference on Concurrency Theory (CONCUR 2020), Sep 2020, Vienna, Austria. ⟨10.4230/LIPIcs.CONCUR.2020.46⟩
Communication dans un congrès
hal-03457885v1
|
||
|
|
How Hard is It to Verify Flat Affine Counter Systems with the Finite Monoid Property?14th International Symposium on Automated Technology for Verification and Analysis, Oct 2016, Chiba, Japan. pp.89-105, ⟨10.1007/978-3-319-46520-3_6⟩
Communication dans un congrès
hal-01418881v1
|
||
|
|
Verification of Ad Hoc Networks with Node and Communication Failures 14th International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 32nd International Conference on Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2012, Stockholm, Sweden. pp.235-250
Communication dans un congrès
hal-00909367v1
|
||
|
|
Playing with Probabilities in Reconfigurable Broadcast NetworksFoundations of Software Science and Computation Structures (FoSSaCS'14), Apr 2014, Grenoble, France. pp.134-148, ⟨10.1007/978-3-642-54830-7_9⟩
Communication dans un congrès
hal-01082129v1
|
||
|
|
Distributed local strategies in broadcast networks[Research Report] Inria Rennes. 2015
Rapport
hal-01170796v1
|
||
|
|
Reachability in Distributed Memory AutomataComputer Science Logic (CSL) 2021, Jan 2021, Ljubljana, Slovenia. ⟨10.4230/LIPIcs.CSL.2021.13⟩
Communication dans un congrès
hal-02983089v1
|
||
|
|
Local First-Order Logic with Two Data Values41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021), Dec 2021, Goa, India. pp.39:1-39:15
Communication dans un congrès
hal-03353214v1
|
||
|
|
When Model-Checking Freeze LTL over Counter Machines Becomes DecidableFOSSACS 2010 - Foundations of Software Science and Computational Structures, 13th International Conference, Luke Ong, Mar 2010, Paphos, Cyprus. pp.176-190, ⟨10.1007/978-3-642-12032-9_13⟩
Communication dans un congrès
hal-03201974v1
|
||
|
|
Model Checking Freeze LTL over One-Counter Automata11th International Conference on Foundations of Software Science and Computation Structures (FoSSaC'08), Apr 2008, Budapest, Hungary. pp.490-504, ⟨10.1007/978-3-540-78499-9_34⟩
Communication dans un congrès
hal-03201399v1
|
||
|
|
Model checking memoryful linear-time logics over one-counter automataTheoretical Computer Science, 2010, 411 (22-24), pp.2298-2316. ⟨10.1016/j.tcs.2010.02.021⟩
Article dans une revue
hal-03190262v1
|
||
|
|
On the Existential Fragments of Local First-Order Logics with Data13th International Symposium on Games, Automata, Logics and Formal Verification (GandALF 2022), Sep 2022, Madrid, Spain. pp.1-16, ⟨10.4204/EPTCS.370.1⟩
Communication dans un congrès
hal-03794335v1
|
||
|
|
Parameterized Verification of Algorithms for Oblivious Robots on a Ring[Research Report] UPMC Sorbonne Universités. 2017
Rapport
hal-01540339v1
|
||
|
|
Equivalence Between Model-Checking Flat Counter Systems and Presburger ArithmeticTheoretical Computer Science, 2017, 735, pp.2-23. ⟨10.1016/j.tcs.2017.07.007⟩
Article dans une revue
hal-03192244v1
|
||
|
|
Playing with probabilities in Reconfigurable Broadcast Networks2014
Pré-publication, Document de travail
hal-00929857v1
|
||
|
|
Taming Past LTL and Flat Counter Systems6th International Joint Conference, IJCAR 2012, Bernhard Gramlich; Dale Miller; Uli Sattler, Jun 2012, Manchester, United Kingdom. pp.179-193, ⟨10.1007/978-3-642-31365-3_16⟩
Communication dans un congrès
hal-03202398v1
|
||
Distributed local strategies in broadcast networks26th International Conference on Concurrency Theory (CONCUR 2015), Sep 2015, Madrid, Spain. pp.44-57, ⟨10.4230/LIPIcs.CONCUR.2015.44⟩
Communication dans un congrès
hal-01243595v1
|
|||
|
|
On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks2012
Rapport
hal-00740518v1
|
||
|
|
Parameterized verification of algorithms for oblivious robots on a ringFormal Methods in Computer Aided Design, Oct 2017, Vienna, Austria. pp.212-219, ⟨10.23919/FMCAD.2017.8102262⟩
Communication dans un congrès
hal-01664894v1
|