Loïg Jezequel

Orcid: 0000-0001-5113-9668

According to our database1, Loïg Jezequel authored at least 22 papers between 2009 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Pomset bisimulation and unfolding for reset Petri nets.
Inf. Comput., 2022

2021
Study of the efficiency of model checking techniques using results of the MCC from 2015 To 2019.
Int. J. Softw. Tools Technol. Transf., 2021

An Algorithm for Single-Source Shortest Paths Enumeration in Parameterized Weighted Graphs.
Proceedings of the Language and Automata Theory and Applications, 2021

A Lazy Query Scheme for Reachability Analysis in Petri Nets.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2021

2020
Distributed computation of vector clocks in Petri net unfoldings for test selection.
Discret. Event Dyn. Syst., 2020

2019

2018
MCC'2017 - The Seventh Model Checking Contest.
Trans. Petri Nets Other Model. Concurr., 2018

Pomsets and Unfolding of Reset Petri Nets.
Proceedings of the Language and Automata Theory and Applications, 2018

2017
Let's Be Lazy, We Have Time - Or, Lazy Reachability Analysis for Timed Automata.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2017

2016
MCC'2015 - The Fifth Model Checking Contest.
Trans. Petri Nets Other Model. Concurr., 2016

Lazy Reachability Analysis in Distributed Systems.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015
Factored Planning: From Automata to Petri Nets.
ACM Trans. Embed. Comput. Syst., 2015

Factored Cost-Optimal Planning Using Message Passing Algorithms.
Fundam. Informaticae, 2015

2014
Message-Passing Algorithms for the Verification of Distributed Protocols.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2014

Characterization of Reachable Attractors Using Petri Net Unfoldings.
Proceedings of the Computational Methods in Systems Biology, 2014

2013
Computation of Summaries Using Net Unfoldings.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012
Distributed cost-optimal planning. (Planification optimale distribuée).
PhD thesis, 2012

Turbo planning.
Proceedings of the 11th International Workshop on Discrete Event Systems, 2012

A#: A distributed version of A* for factored planning.
Proceedings of the 51th IEEE Conference on Decision and Control, 2012

2010
On the construction of probabilistic diagnosers.
Proceedings of the 10th International Workshop on Discrete Event Systems, 2010

Cost-Optimal Factored Planning: Promises and Pitfalls.
Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010

2009
Distributed optimal planning: an approach by weighted automata calculus.
Proceedings of the 48th IEEE Conference on Decision and Control, 2009


  Loading...