Filtrer vos résultats
- 4
- 3
- 3
- 3
- 1
- 1
- 7
- 1
- 2
- 2
- 1
- 1
- 7
- 4
- 3
- 2
- 1
- 1
- 1
- 1
- 7
- 6
- 3
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
7 résultats
|
|
|
triés par
|
Approaching the Coverability Problem Continuously[Research Report] 1510.05724, Computing Research Repository. 2015
Rapport
hal-01242916v1
|
|||
|
|
Succinct Population Protocols for Presburger ArithmeticSTACS 2020 - 37th International Symposium on Theoretical Aspects of Computer Science, Mar 2020, Montpellier, France. pp.1-15, ⟨10.4230/LIPIcs.STACS.2020.40⟩
Communication dans un congrès
hal-03065533v1
|
||
Forward Analysis for WSTS, Part III: Karp-Miller TreesLogical Methods in Computer Science, 2020, 16 (2)
Article dans une revue
hal-03216116v1
|
|||
|
|
The Logical View on Continuous Petri NetsACM Transactions on Computational Logic, 2017, 18 (3)
Article dans une revue
hal-01652793v1
|
||
|
|
Approaching the Coverability Problem Continuously22nd International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS 2016), Apr 2016, Eindhoven, Netherlands. pp.480-496, ⟨10.1007/978-3-662-49674-9_28⟩
Communication dans un congrès
hal-01408044v1
|
||
|
|
Forward Analysis for WSTS, Part III: Karp-Miller Trees37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Dec 2017, Kanpur, India. ⟨10.4230/LIPIcs.FSTTCS.2017.16⟩
Communication dans un congrès
hal-01736704v1
|
||
|
|
The Reachability Problem for Two-Dimensional Vector Addition Systems with StatesJournal of the ACM (JACM), 2021, 68 (5), pp.1-43. ⟨10.1145/3464794⟩
Article dans une revue
hal-04270941v1
|