default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDenis Poitrenaud
Person information
- affiliation: LIP6, Paris
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Yann Thierry-Mieg, Etienne Renault
, Emmanuel Paviot-Adet, Denis Poitrenaud:
A model-checker exploiting structural reductions even with stutter sensitive LTL. Sci. Comput. Program. 235: 103089 (2024)- 2022
- [c25]Emmanuel Paviot-Adet, Denis Poitrenaud, Etienne Renault, Yann Thierry-Mieg:
LTL Under Reductions with Weaker Conditions Than Stutter Invariance. FORTE 2022: 170-187 - [i3]Emmanuel Paviot-Adet, Denis Poitrenaud, Etienne Renault, Yann Thierry-Mieg:
Structural Reductions and Stutter Sensitive Properties. CoRR abs/2212.04218 (2022) - 2021
- [i2]Emmanuel Paviot-Adet, Denis Poitrenaud, Etienne Renault, Yann Thierry-Mieg:
LTL under reductions with weaker conditions than stutter-invariance. CoRR abs/2111.03342 (2021)
2010 – 2019
- 2019
- [c24]Denis Poitrenaud, Etienne Renault:
Combining Parallel Emptiness Checks with Partial Order Reductions. ICFEM 2019: 370-386 - 2017
- [j5]Etienne Renault, Alexandre Duret-Lutz, Fabrice Kordon, Denis Poitrenaud:
Variations on parallel explicit emptiness checks for generalized Büchi automata. Int. J. Softw. Tools Technol. Transf. 19(6): 653-673 (2017) - 2016
- [c23]Alexandre Duret-Lutz, Fabrice Kordon, Denis Poitrenaud, Etienne Renault:
Heuristics for Checking Liveness Properties with Partial Order Reductions. ATVA 2016: 340-356 - 2015
- [c22]Etienne Renault, Alexandre Duret-Lutz, Fabrice Kordon, Denis Poitrenaud:
Parallel Explicit Model Checking for Generalized Büchi Automata. TACAS 2015: 613-627 - 2013
- [j4]Jean-Michel Couvreur, Denis Poitrenaud, Pascal Weil:
Branching Processes of General Petri Nets. Fundam. Informaticae 122(1-2): 31-58 (2013) - [c21]Etienne Renault, Alexandre Duret-Lutz, Fabrice Kordon, Denis Poitrenaud:
Three SCC-Based Emptiness Checks for Generalized Büchi Automata. LPAR 2013: 668-682 - [c20]Etienne Renault, Alexandre Duret-Lutz, Fabrice Kordon, Denis Poitrenaud:
Strength-Based Decomposition of the Property Büchi Automaton for Faster Model Checking. TACAS 2013: 580-593 - 2011
- [j3]Souheib Baarir, Cécile Braunstein, Emmanuelle Encrenaz, Jean-Michel Ilié, Isabelle Mounier, Denis Poitrenaud, Sana Younès:
Feasibility analysis for robustness quantification by symbolic model checking. Formal Methods Syst. Des. 39(2): 165-184 (2011) - [c19]Jean-Michel Couvreur, Denis Poitrenaud, Pascal Weil:
Branching Processes of General Petri Nets. Petri Nets 2011: 129-148 - [c18]Alexandre Duret-Lutz, Kais Klai, Denis Poitrenaud, Yann Thierry-Mieg:
Self-Loop Aggregation Product - A New Hybrid Approach to On-the-Fly LTL Model Checking. ATVA 2011: 336-350 - [i1]Alexandre Duret-Lutz, Kais Klai, Denis Poitrenaud, Yann Thierry-Mieg:
Combining Explicit and Symbolic Approaches for Better On-the-Fly LTL Model Checking. CoRR abs/1106.5700 (2011)
2000 – 2009
- 2009
- [c17]Alexandre Duret-Lutz, Denis Poitrenaud, Jean-Michel Couvreur:
On-the-fly Emptiness Check of Transition-Based Streett Automata. ATVA 2009: 213-227 - [c16]Souheib Baarir, Cécile Braunstein, Renaud Clavel, Emmanuelle Encrenaz, Jean-Michel Ilié, Régis Leveugle, Isabelle Mounier, Laurence Pierre, Denis Poitrenaud:
Complementary Formal Approaches for Dependability Analysis. DFT 2009: 331-339 - [c15]Yann Thierry-Mieg, Denis Poitrenaud, Alexandre Hamez, Fabrice Kordon:
Hierarchical Set Decision Diagrams and Regular Models. TACAS 2009: 1-15 - 2008
- [c14]Kais Klai, Denis Poitrenaud:
MC-SOG: An LTL Model Checker Based on Symbolic Observation Graphs. Petri Nets 2008: 288-306 - 2007
- [j2]Serge Haddad, Denis Poitrenaud:
Recursive Petri nets. Acta Informatica 44(7-8): 463-508 (2007) - 2005
- [c13]Jean-Michel Couvreur, Alexandre Duret-Lutz, Denis Poitrenaud:
On-the-Fly Emptiness Checks for Generalized Büchi Automata. SPIN 2005: 169-184 - 2004
- [c12]Yann Thierry-Mieg, Jean-Michel Ilié, Denis Poitrenaud:
A Symbolic Symbolic State Space Representation. FORTE 2004: 276-291 - [c11]Alexandre Duret-Lutz, Denis Poitrenaud:
SPOT: An Extensible Model Checking Library Using Transition-Based Generalized Büchi Automata. MASCOTS 2004: 76-83 - [p1]François Breant, Jean-Michel Couvreur, Frédéric Gilliers, Fabrice Kordon, Isabelle Mounier, Emmanuel Paviot-Adet, Denis Poitrenaud, Dan Marius Regep, Grégoire Sutre:
Modeling and verifying behavioral aspects. Formal Methods for Embedded Distributed Systems 2004: 171-211 - 2002
- [c10]Jean-Michel Couvreur, Emmanuelle Encrenaz, Emmanuel Paviot-Adet, Denis Poitrenaud, Pierre-André Wacrenier:
Data Decision Diagrams for Petri Net Analysis. ICATPN 2002: 101-120 - 2001
- [j1]Luciana Bezerra Arantes, Denis Poitrenaud, Pierre Sens, Bertil Folliot:
The Barrier-Lock Clock: A Scalable Synchronization-Oriented Logical Clock. Parallel Process. Lett. 11(1): 65-76 (2001) - [c9]Jean-Michel Couvreur, Sébastien Grivet, Denis Poitrenaud:
Unfolding of Products of Symmetrical Petri Nets. ICATPN 2001: 121-143 - [c8]Serge Haddad, Denis Poitrenaud:
Checking Linear Temporal Formulas on Sequential Recursive Petri Nets. TIME 2001: 198-205 - 2000
- [c7]Sabine Boufenara, Zizette Boufriche-Boufaïda, Mahmoud Boufaïda, Denis Poitrenaud:
Multimedia Information Systems: Towards a Design Methodology Based on Spatio-Temporal Relations, Petri Nets, and ECA Rules. ADVIS 2000: 384-397 - [c6]Jean-Michel Couvreur, Sébastien Grivet, Denis Poitrenaud:
Designing a LTL Model-Checker Based on Unfolding Graphs. ICATPN 2000: 123-145 - [c5]Denis Poitrenaud, Jean-François Pradat-Peyre:
Pre- and Post-agglomerations for LTL Model Checking. ICATPN 2000: 387-408
1990 – 1999
- 1999
- [c4]Serge Haddad, Denis Poitrenaud:
Theoretical Aspects of Recursive Petri Nets. ICATPN 1999: 228-247 - [c3]Jean-Michel Couvreur, Denis Poitrenaud:
Detection of Illegal Behaviors Based on Unfoldings. ICATPN 1999: 364-383 - 1996
- [c2]Jean-Michel Couvreur, Denis Poitrenaud:
Model Checking Based on Occurrence Net Graph. FORTE 1996: 380-395 - 1995
- [c1]Robert Brgan, Denis Poitrenaud:
An Efficient Algorithm for the Computation of Stubborn Sets of Well Formed Petri Nets. Application and Theory of Petri Nets 1995: 121-140
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-06-03 01:01 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:
