default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLoïg Jezequel
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j7]Thomas Chatain, Maurice Comlan
, David Delfieu, Loïg Jezequel, Olivier Henri Roux:
Pomset bisimulation and unfolding for reset Petri nets. Inf. Comput. 283: 104674 (2022)- 2021
- [j6]Fabrice Kordon, Lom-Messan Hillah, Francis Hulin-Hubard, Loïg Jezequel, Emmanuel Paviot-Adet:
Study of the efficiency of model checking techniques using results of the MCC from 2015 To 2019. Int. J. Softw. Tools Technol. Transf. 23(6): 931-952 (2021) - [c15]Loïg Jezequel, Didier Lime, Bastien Sérée:
A Lazy Query Scheme for Reachability Analysis in Petri Nets. Petri Nets 2021: 360-378 - [c14]Bastien Sérée, Loïg Jezequel, Didier Lime:
An Algorithm for Single-Source Shortest Paths Enumeration in Parameterized Weighted Graphs. LATA 2021: 279-290 - 2020
- [j5]Loïg Jezequel, Agnes Madalinski, Stefan Schwoon:
Distributed computation of vector clocks in Petri net unfoldings for test selection. Discret. Event Dyn. Syst. 30(3): 441-464 (2020)
2010 – 2019
- 2019
- [c13]Elvio Gilberto Amparore, Bernard Berthomieu, Gianfranco Ciardo, Silvano Dal-Zilio, Francesco Gallà, Lom-Messan Hillah, Francis Hulin-Hubard, Peter Gjøl Jensen, Loïg Jezequel, Fabrice Kordon, Didier Le Botlan, Torsten Liebke, Jeroen Meijer, Andrew S. Miner, Emmanuel Paviot-Adet, Jirí Srba, Yann Thierry-Mieg, Tom van Dijk, Karsten Wolf:
Presentation of the 9th Edition of the Model Checking Contest. TACAS (3) 2019: 50-68 - 2018
- [j4]Fabrice Kordon, Hubert Garavel, Lom-Messan Hillah, Emmanuel Paviot-Adet, Loïg Jezequel, Francis Hulin-Hubard, Elvio Gilberto Amparore, Marco Beccuti, Bernard Berthomieu, Hugues Evrard, Peter Gjøl Jensen, Didier Le Botlan, Torsten Liebke, Jeroen Meijer, Jirí Srba, Yann Thierry-Mieg, Jaco van de Pol, Karsten Wolf:
MCC'2017 - The Seventh Model Checking Contest. Trans. Petri Nets Other Model. Concurr. 13: 181-209 (2018) - [c12]Thomas Chatain, Maurice Comlan, David Delfieu, Loïg Jezequel, Olivier H. Roux:
Pomsets and Unfolding of Reset Petri Nets. LATA 2018: 258-270 - 2017
- [c11]Loïg Jezequel, Didier Lime:
Let's Be Lazy, We Have Time - Or, Lazy Reachability Analysis for Timed Automata. FORMATS 2017: 247-263 - 2016
- [j3]Fabrice Kordon, Hubert Garavel, Lom-Messan Hillah, Emmanuel Paviot-Adet, Loïg Jezequel, César Rodríguez, Francis Hulin-Hubard:
MCC'2015 - The Fifth Model Checking Contest. Trans. Petri Nets Other Model. Concurr. 11: 262-273 (2016) - [c10]Loïg Jezequel, Didier Lime:
Lazy Reachability Analysis in Distributed Systems. CONCUR 2016: 17:1-17:14 - [e1]Thomas Brihaye, Benoît Delahaye, Loïg Jezequel, Nicolas Markey, Jirí Srba:
Proceedings Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters, Cassting/SynCoP 2016, Eindhoven, The Netherlands, April 2-3, 2016. EPTCS 220, 2016 [contents] - 2015
- [j2]Loïg Jezequel, Eric Fabre:
Factored Cost-Optimal Planning Using Message Passing Algorithms. Fundam. Informaticae 139(4): 369-401 (2015) - [j1]Loïg Jezequel, Eric Fabre, Victor Khomenko:
Factored Planning: From Automata to Petri Nets. ACM Trans. Embed. Comput. Syst. 14(2): 26:1-26:25 (2015) - 2014
- [c9]Thomas Chatain, Stefan Haar, Loïg Jezequel, Loïc Paulevé, Stefan Schwoon:
Characterization of Reachable Attractors Using Petri Net Unfoldings. CMSB 2014: 129-142 - [c8]Loïg Jezequel, Javier Esparza:
Message-Passing Algorithms for the Verification of Distributed Protocols. VMCAI 2014: 222-241 - 2013
- [c7]Loïg Jezequel, Eric Fabre, Victor Khomenko:
Factored Planning: From Automata to Petri Nets. ACSD 2013: 130-139 - [c6]Javier Esparza, Loïg Jezequel, Stefan Schwoon:
Computation of Summaries Using Net Unfoldings. FSTTCS 2013: 225-236 - [i1]Javier Esparza, Loïg Jezequel, Stefan Schwoon:
Computation of Summaries Using Net Unfoldings. CoRR abs/1310.2143 (2013) - 2012
- [b1]Loïg Jezequel:
Distributed cost-optimal planning. (Planification optimale distribuée). École normale supérieure de Cachan, France, 2012 - [c5]Loïg Jezequel, Eric Fabre:
A#: A distributed version of A* for factored planning. CDC 2012: 7377-7382 - [c4]Loïg Jezequel, Eric Fabre:
Turbo planning. WODES 2012: 301-306 - 2010
- [c3]Eric Fabre, Loïg Jezequel, Patrik Haslum, Sylvie Thiébaux:
Cost-Optimal Factored Planning: Promises and Pitfalls. ICAPS 2010: 65-72 - [c2]Eric Fabre, Loïg Jezequel:
On the construction of probabilistic diagnosers. WODES 2010: 229-234
2000 – 2009
- 2009
- [c1]Eric Fabre, Loïg Jezequel:
Distributed optimal planning: an approach by weighted automata calculus. CDC 2009: 211-216
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
