Filter your results
- 24
- 16
- 23
- 13
- 2
- 1
- 1
- 37
- 1
- 1
- 1
- 2
- 3
- 1
- 2
- 4
- 3
- 2
- 1
- 1
- 4
- 1
- 4
- 3
- 5
- 1
- 2
- 40
- 35
- 4
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 40
- 10
- 8
- 8
- 5
- 4
- 4
- 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
40 Results
|
|
sorted by
|
|
Flat Acceleration in Symbolic Model CheckingThird International Symposium, ATVA 2005, 2005, Taipei, Taiwan. pp.474-488, ⟨10.1007/11562948_35⟩
Conference papers
hal-00346302v1
|
||
|
On Termination for Faulty Channel MachinesSTACS 2008, Feb 2008, Bordeaux, France. pp.121-132
Conference papers
hal-00220515v1
|
||
|
The complexity of propositional linear temporal logics in simple casesAnnual Symposium on Theoretical Aspects of Computer Science (STACS 1998), Jan 1998, Paris, France. pp.61-72, ⟨10.1007/BFb0028549⟩
Conference papers
hal-03199998v1
|
||
|
Symbolic Model Checking for Simply-Timed SystemsProceedings of the Joint Conferences Formal Modelling and Analysis of Timed Systems (FORMATS'04) and Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT'04), 2004, Grenoble, France. pp.102-117
Conference papers
hal-01194620v1
|
||
|
On Model Checking Durational Kripke Structures (Extended Abstract)Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'02), 2002, Grenoble, France. pp.264-279
Conference papers
hal-01194632v1
|
||
|
Model Checking Timed Automata with One or Two ClocksProceedings of the 15th International Conference on Concurrency Theory (CONCUR'04), 2004, London, UK, Unknown Region. pp.387-401, ⟨10.1007/978-3-540-28644-8_25⟩
Conference papers
hal-01194617v1
|
||
|
On the state complexity of closures and interiors of regular languages with subwords and superwordsTheoretical Computer Science, 2016, 610, pp.91-107. ⟨10.1016/j.tcs.2015.09.028⟩
Journal articles
hal-03441921v1
|
||
The height of piecewise-testable languages and the complexity of the logic of subwordsLogical Methods in Computer Science, 2019
Journal articles
hal-02408723v1
|
|||
|
Temporal Logic with Forgettable PastProceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02), 2002, Copenhagen, Denmark. pp.383-392, ⟨10.1109/LICS.2002.1029846⟩
Conference papers
hal-01194631v1
|
||
|
A Parametric Analysis of the State-Explosion Problem in Model CheckingJournal of Computer and System Sciences, 2006, 72 (4), pp.547--575. ⟨10.1016/j.jcss.2005.11.003⟩
Journal articles
hal-03189811v1
|
||
On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics.LATIN 2000: Theoretical Informatics, 4th Latin American Symposium, Apr 2000, Punta del Este, Uruguay, pp.437-446
Conference papers
inria-00104142v1
|
|||
|
A PTIME-Complete Matching Problem for SLP-Compressed WordsInformation Processing Letters, 2004, 90 (1), pp.3-6. ⟨10.1016/j.ipl.2004.01.002⟩
Journal articles
hal-01194622v1
|
||
|
Efficient Timed Model Checking for Discrete-Time SystemsTheoretical Computer Science, 2006, 353 (1-3), pp.249-271. ⟨10.1016/j.tcs.2005.11.020⟩
Journal articles
hal-01194608v1
|
||
|
The Power of Priority Channel SystemsLogical Methods in Computer Science, 2014, 10 (4:4), pp.1--39. ⟨10.2168/LMCS-10(4:4)2014⟩
Journal articles
hal-01091086v1
|
||
|
TSMV: A Symbolic Model Checker for Quantitative Analysis of SystemsProceedings of the 1st International Conference on Quantitative Evaluation of Systems (QEST'04), 2004, Enschede, Netherlands. pp.330-331, ⟨10.1109/QEST.2004.10028⟩
Conference papers
hal-01194623v1
|
||
|
The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderingsWell Quasi-Orders in Computation, Logic, Language and Reasoning, 53, Springer, pp.55-105, 2020, Trends in Logic, 978-3-030-30228-3. ⟨10.1007/978-3-030-30229-0_3⟩
Book sections
hal-03083290v1
|
||
|
On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems.13th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'06), Nov 2006, Phnom Penh, Cambodia. ⟨10.1007/11916277_24⟩
Conference papers
inria-00424346v1
|
||
|
Verifying nondeterministic probabilistic channel systems against omega-regular linear-time properties.ACM Transactions on Computational Logic, 2007, 9 (1), ⟨10.1145/1297658.1297663⟩
Journal articles
inria-00424516v1
|
||
|
On Ordinal Invariants in Well Quasi Orders and Finite Antichain OrdersPeter M. Schuster; Monika Seisenberger; Andreas Weiermann. Well-Quasi Orders in Computation, Logic, Language and Reasoning, 53, Springer, 2020, Trends in Logic, ⟨10.1007/978-3-030-30229-0_2⟩
Book sections
halshs-01625981v1
|
||
|
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma26th Annual IEEE Symposium on Logic in Computer Science, Jun 2011, Toronto, Canada. p. 269--278, ⟨10.1109/LICS.2011.39⟩
Conference papers
hal-00609871v1
|
||
|
On Functions Weakly Computable by Petri Nets and Vector Addition SystemsReachability Problems - 8th International Workshop, {RP} 2014, Sep 2014, Oxford, United Kingdom. pp.190 - 202, ⟨10.1007/978-3-319-11439-2_15⟩
Conference papers
hal-01084971v1
|
||
|
Algorithmic Aspects of WQO TheoryMaster. France. 2012
Lectures
cel-00727025v2
|
||
|
On flat lossy channel machines29th EACSL Conference on Computer Science Logic, Jan 2021, Ljubljana, Slovenia. ⟨10.4230/LIPIcs.CSL.2021.37⟩
Conference papers
hal-03441933v1
|
||
|
Mu-Calculus Path CheckingInformation Processing Letters, 2006, 97 (6), pp.225-230. ⟨10.1016/j.ipl.2005.11.010⟩
Journal articles
hal-01194606v1
|
||
|
Unidirectional Channel Systems Can Be Tested7th International Conference on Theoretical Computer Science (TCS), Sep 2012, Amsterdam, Netherlands. pp.149-163, ⟨10.1007/978-3-642-33475-7_11⟩
Conference papers
hal-01556219v1
|
||
|
On Functions Weakly Computable by Pushdown Petri Nets and Related SystemsLogical Methods in Computer Science, 2019, 15 (4), ⟨10.23638/LMCS-15(4:15)2019⟩
Journal articles
hal-02506437v1
|
||
|
A Parametric Analysis of the State Explosion Problem in Model Checking19th Annual Symposium on Theoretical Aspects of Computer Science Antibes - Juan les Pins, Helmut Alt; Afonso Ferreira, Mar 2002, Antibes - Juan les Pins, France. pp.620-631, ⟨10.1007/3-540-45841-7_51⟩
Conference papers
hal-03202661v1
|
||
|
On the expressivity and complexity of quantitative branching-time temporal logics.Theoretical Computer Science, 2003, Theoretical Computer Science, 1-3 (297), pp.297-315. ⟨10.1016/S0304-3975(02)00644-8⟩
Journal articles
inria-00104145v1
|
||
|
The Regular Viewpoint on PA-Processes[Research Report] RR-3403, INRIA. 1998, pp.27
Reports
inria-00073287v1
|
||
|
The Power of Priority Channel Systems24th International Conference on Concurrency Theory, Aug 2013, Buenos Aires, Argentina. pp.319--333, ⟨10.1007/978-3-642-40184-8_23⟩
Conference papers
hal-00793809v1
|
- 1
- 2