Filter your results
- 26
- 24
- 1
- 23
- 20
- 3
- 2
- 1
- 1
- 1
- 46
- 5
- 1
- 4
- 4
- 7
- 5
- 2
- 2
- 3
- 2
- 1
- 1
- 4
- 1
- 2
- 4
- 2
- 1
- 1
- 2
- 1
- 2
- 48
- 2
- 1
- 28
- 13
- 12
- 11
- 8
- 6
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 51
- 14
- 11
- 8
- 7
- 6
- 6
- 5
- 4
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 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
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
51 Results
|
|
sorted by
|
FAST: Fast Acceleration of Symbolic Transition Systems15th international conference on Computer Aided Verification, 2003, United States. pp.118-121
Conference papers
hal-00084185v1
|
|||
|
Towards a model-checker for counter systemsATVA 2006 - 4th International Symposium on Automated Technology for Verification and Analysis, Susanne Graf; Wenhui Zhang, Oct 2006, Beijing, China. pp.493-507, ⟨10.1007/11901914_36⟩
Conference papers
hal-03203578v1
|
||
Recent and simple algorithms for Petri netsSoftware and Systems Modeling, 2015, 14 (2), pp.719-725. ⟨10.1007/s10270-014-0426-0⟩
Journal articles
hal-02391830v1
|
|||
|
Forward Analysis for WSTS, Part II: Complete WSTSLogical Methods in Computer Science, 2012, 8 (3), ⟨10.2168/LMCS-8(3:28)2012⟩
Journal articles
hal-03189994v1
|
||
|
Commodification of accelerations for the Karp and Miller Construction.Discrete Event Dynamic Systems, In press
Journal articles
hal-03137054v1
|
||
|
The Theory of WSTS: The Case of Complete WSTSProceedings of the 33rd International Conference on Applications and Theory of Petri Nets (PETRI NETS'12), volume 7347 of Lecture Notes in Computer Science, Hamburg, Germany. Springer, pp.3-31, 2012, ⟨10.1007/978-3-642-31131-4_2⟩
Book sections
hal-03189998v1
|
||
|
Flat Acceleration in Symbolic Model CheckingThird International Symposium, ATVA 2005, 2005, Taipei, Taiwan. pp.474-488, ⟨10.1007/11562948_35⟩
Conference papers
hal-00346302v1
|
||
|
Bounded Reachability Problems are Decidable in FIFO Machines31st International Conference on Concurrency Theory (CONCUR 2020), Sep 2020, Vienna, Austria
Conference papers
hal-02900813v1
|
||
|
Consciousness, Free Energy and Cognitive AlgorithmsFrontiers in Psychology, 2020, 11, pp.1675. ⟨10.3389/fpsyg.2020.01675⟩
Journal articles
hal-03066506v1
|
||
|
Reachability Problems - 6th International Workshop, RP 2012Spinger, pp.150, 2012, 978-3-642-33511-2. ⟨10.1007/978-3-642-33512-9⟩
Books
hal-00760303v1
|
||
|
Forward Analysis and Model Checking for Trace Bounded WSTS32nd International Conference on Application and Theory of Petri Nets, Jun 2011, Newcastle, United Kingdom. p. 49--68, ⟨10.1007/978-3-642-21834-7_4⟩
Conference papers
hal-00610011v1
|
||
Forward Analysis for WSTS, Part III: Karp-Miller TreesLogical Methods in Computer Science, 2020, 16 (2)
Journal articles
hal-03216116v1
|
|||
|
Automatic Verification of Counter Systems With Ranking FunctionElectronic Notes in Theoretical Computer Science, 2009, 239, pp.85-103. ⟨10.1016/j.entcs.2009.05.032⟩
Journal articles
hal-01195921v1
|
||
|
Property-Directed Verification of Recurrent Neural Networks2020
Preprints, Working Papers, ...
hal-03134999v1
|
||
|
The convex hull of a regular set of integer vectors is polyhedral and effectively computableInformation Processing Letters, 2005, 96 (1), pp.30 - 35. ⟨10.1016/j.ipl.2005.04.004⟩
Journal articles
hal-00345982v1
|
||
|
FAST: acceleration from theory to practiceInternational Journal on Software Tools for Technology Transfer, 2008, 10 (5), pp.401-424. ⟨10.1007/s10009-008-0064-3⟩
Journal articles
hal-00345968v1
|
||
|
Réification des accélérations pour la construction de Karp et MillerModélisation des Systèmes Réactifs (MSR 19), Nov 2019, Angers, France, Nov 2019, Angers, France
Conference papers
hal-02431913v1
|
||
|
Réification des accélérations pour la construction de Karp et MillerMSR 2019 - 12ème Colloque sur la Modélisation des Systèmes Réactifs, Nov 2019, Angers, France
Conference papers
hal-02319755v1
|
||
|
Model-Checking CTL* over Flat Presburger Counter SystemsJournal of Applied Non-Classical Logics, 2010, 20 (4), pp.313-344. ⟨10.3166/jancl.20.313-344⟩
Journal articles
hal-03191246v1
|
||
|
Ordinal Theory for Expressiveness of Well-Structured Transition SystemsInformation and Computation, 2013, 224, pp.1-22. ⟨10.1016/j.ic.2012.11.003⟩
Journal articles
hal-00925762v1
|
||
|
Natural Language Processing for Cognitive Analysis of EmotionsEMPG - Meeting of the EUROPEAN MATHEMATICAL PSYCHOLOGY GROUP 2022, Sep 2022, Rovereto, Italy
Poster communications
hal-03805768v1
|
||
|
Handling infinitely branching well-structured transition systemsInformation and Computation, 2018, 258, pp.28-49. ⟨10.1016/j.ic.2017.11.001⟩
Journal articles
hal-03415332v1
|
||
|
Model Checking Vector Addition Systems with one zero-testLogical Methods in Computer Science, 2012, 8 (2), pp.11. ⟨10.2168/LMCS-8(2:11)2012⟩
Journal articles
hal-00722324v1
|
||
|
Place-Boundedness for Vector Addition Systems with one zero-testFSTTCS 2010, Dec 2010, India. pp.192--203
Conference papers
hal-00948975v1
|
||
|
Forward analysis for WSTS, Part I: Completions26th International Symposium on Theoretical Aspects of Computer Science - STACS 2009, Feb 2009, Freiburg, Germany. pp.433-444
Conference papers
inria-00359699v1
|
||
Forward Analysis for WSTS, Part I: CompletionsLeibniz-Zentrum für Informatik. Proceedings of the 26th Annual Symposium on Theoretical Aspects of Computer Science (STACS'09), volume 3 of Leibniz International Proceedings in Informatics, Freiburg, Germany., pp.433-444, 2009
Book sections
hal-03195833v1
|
|||
|
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⟩
Conference papers
hal-01736704v1
|
||
|
Forward Analysis and Model Checking for Trace Bounded WSTSTheoretical Computer Science, 2016, 637, pp.1--29. ⟨10.1016/j.tcs.2016.04.020⟩
Journal articles
hal-01329871v1
|
||
|
PrefaceFundamenta Informaticae, 2016, 143 (3-4), pp.i-ii. ⟨10.3233/FI-2016-1311⟩
Journal articles
hal-02391811v1
|
||
|
Extracting Context-Free Grammars from Recurrent Neural Networks using Tree-Automata Learning and A* SearchICGI 2021 - 15th International Conference on Grammatical Inference, Aug 2021, New York City / Virtual, United States. pp.113-129
Conference papers
hal-03285433v1
|
- 1
- 2