Filter your results
- 20
- 7
- 17
- 6
- 1
- 1
- 1
- 1
- 1
- 27
- 1
- 1
- 3
- 1
- 1
- 3
- 1
- 3
- 2
- 2
- 2
- 4
- 1
- 2
- 1
- 27
- 14
- 11
- 10
- 7
- 6
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 27
- 6
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 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
27 Results
|
|
sorted by
|
|
Distributed Optimal Planning: an Approach by Weighted Automata Calculus48th IEEE Conference on Decision and Control, Dec 2009, Shanghai, China. pp.211-216
Conference papers
hal-00931846v1
|
||
|
Let's Be Lazy, We Have Time or, Lazy Reachability Analysis for Timed Automata15th International Conference on Formal Modeling and Analysis of Timed Systems, Sep 2017, Berlin, Germany
Conference papers
hal-01699301v1
|
||
|
Networks of automata with read arcs: a tool for distributed planning18th IFAC World Congress, Aug 2011, Milan, Italy
Conference papers
hal-01699586v1
|
||
|
A Lazy Query Scheme for Reachability Analysis in Petri NetsInternational Conference on Applications and Theory of Petri Nets and Concurrency, Jun 2021, Paris, France. pp.360-378, ⟨10.1007/978-3-030-76983-3_18⟩
Conference papers
hal-03561703v1
|
||
|
An Algorithm for Single-Source Shortest Paths Enumeration in Parameterized Weighted GraphsLanguage and Automata Theory and Applications, Sep 2021, Milan, Italy. pp.279-290, ⟨10.1007/978-3-030-68195-1_22⟩
Conference papers
hal-03561972v1
|
||
|
Message-Passing Algorithms for the Verification of Distributed Protocols15th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI 2014), Jan 2014, San Diego, United States
Conference papers
hal-01699321v1
|
||
|
Factored Planning: From Automata to Petri NetsInternational Conference on Application of Concurrency to System Design (ACSD), Jul 2013, Barcelone, Spain
Conference papers
hal-00931844v1
|
||
Distributed computation of vector clocks in Petri net unfoldings for test selectionDiscrete Event Dynamic Systems, 2020, ⟨10.1007/s10626-020-00310-4⟩
Journal articles
hal-02560296v1
|
|||
Computation of summaries using net unfoldings33rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'13), 2013, Guwahati, India. pp.225-236
Conference papers
hal-00925457v1
|
|||
|
Distributed cost-optimal planningOther [cs.OH]. École normale supérieure de Cachan - ENS Cachan, 2012. English. ⟨NNT : 2012DENS0059⟩
Theses
tel-00825026v1
|
||
|
A#: A distributed version of A* for factored planningCDC 2012 - IEEE 51st Annual Conference on Decision and Control, Dec 2012, Maui, United States. ⟨10.1109/CDC.2012.6426187⟩
Conference papers
hal-01699341v1
|
||
|
On the construction of probabilistic diagnosersWODES 2010 - 10th International Workshop on Discrete Event Systems, Aug 2010, Berlin, Germany. pp.229 - 234, ⟨10.3182/20100830-3-DE-4013.00039⟩
Conference papers
hal-01699592v1
|
||
|
Lazy Reachability Analysis in Distributed Systems27th International Conference on Concurrency Theory (CONCUR 2016), Aug 2016, Québec, Canada. ⟨10.4230/LIPIcs.CONCUR.2016.17⟩
Conference papers
hal-01699311v1
|
||
|
Proceedings Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex ParametersElectronic Proceedings in Theoretical Computer Science, 220, 2016, ⟨10.4204/EPTCS.220⟩
Special issue
hal-02942556v1
|
||
Pomset bisimulation and unfolding for reset Petri netsInformation and Computation, 2022, 283, pp.104674. ⟨10.1016/j.ic.2020.104674⟩
Journal articles
hal-03650582v1
|
|||
|
Cost-Optimal Factored Planning: Promises and Pitfalls ICAPS 2010 - 20th International Conference on Automated Planning and Scheduling), May 2010, Toronto, Canada
Conference papers
hal-01699599v1
|
||
|
MCC’2015 – The Fifth Model Checking ContestLNCS Transactions on Petri Nets and Other Models of Concurrency, 2016, Lecture Notes in Computer Science, 9930, pp.262-273. ⟨10.1007/978-3-662-53401-4_12⟩
Journal articles
hal-01361274v1
|
||
|
Distributed computation of vector clocks in Petri nets unfolding for test selectionWorkshop on Discrete Event Systems (WODES), May 2018, Sorrento, Italy
Conference papers
hal-01735406v1
|
||
Factored Planning: From Automata to Petri NetsACM Transactions on Embedded Computing Systems (TECS), 2015, 14 (2), ⟨10.1145/2656215⟩
Journal articles
hal-01247347v1
|
|||
|
Characterization of Reachable Attractors Using Petri Net UnfoldingsCMSB 2014, Nov 2014, Manchester, United Kingdom. pp.14, ⟨10.1007/978-3-319-12982-2_10⟩
Conference papers
hal-01060450v1
|
||
|
MCC’2017 - The Seventh Model Checking ContestLNCS Transactions on Petri Nets and Other Models of Concurrency, 11090, pp.181-209, 2018, Lecture Notes in Computer Science, ⟨10.1007/978-3-662-58381-4_9⟩
Proceedings
hal-01917492v1
|
||
|
Study of the efficiency of model checking techniques using results of the MCC from 2015 To 2019International Journal on Software Tools for Technology Transfer, 2021, ⟨10.1007/s10009-021-00615-1⟩
Journal articles
hal-03251314v1
|
||
|
Presentation of the 9th Edition of the Model Checking ContestTools and Algorithms for the Construction and Analysis of Systems - 25 Years of TACAS: TOOLympics, Held as Part of ETAPS 2019, Proceedings, Part III, Apr 2019, Prague, Czech Republic. pp.50-68, ⟨10.1007/978-3-030-17502-3_4⟩
Conference papers
hal-02094047v1
|
||
Factored Cost-Optimal Planning Using Message Passing AlgorithmsFundamenta Informaticae, 2015, 139 (4), ⟨10.3233/FI-2015-1239⟩
Journal articles
hal-01247346v1
|
|||
|
Turbo PlanningWodes 2012 - 11th International Workshop on Discrete Event Systems, Oct 2012, Guadalajara, Mexico. pp.301 - 306, ⟨10.3182/20121003-3-MX-4033.00049⟩
Conference papers
hal-01699581v1
|
||
|
Pomsets and Unfolding of Reset Petri NetsLATA 2018 - 12th International Conference on Language and Automata Theory and Applications, Apr 2018, Ramat Gan, Israel
Conference papers
hal-01766530v1
|
||
|
A-sharp: a Distributed A-star for Factored Planning[Research Report] RR-7927, INRIA. 2012
Reports
hal-00687434v1
|