default search action
Claude Dutheillet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c14]Sabrine Saouli, Souheib Baarir, Claude Dutheillet:
Improving SAT Solver Performance Through MLP-Predicted Genetic Algorithm Parameters. IFM 2024: 288-296 - [c13]Sabrine Saouli, Souheib Baarir, Claude Dutheillet:
Tackling the Polarity Initialization Problem in SAT Solving Using a Genetic Algorithm. NFM 2024: 21-36 - 2023
- [c12]Sabrine Saouli, Souheib Baarir, Claude Dutheillet, Jo Devriendt:
CosySEL: Improving SAT Solving Using Local Symmetries. VMCAI 2023: 252-266
2010 – 2019
- 2011
- [j6]Nawel Gharbi, Claude Dutheillet:
An algorithmic approach for analysis of finite-source retrial systems with unreliable servers. Comput. Math. Appl. 62(6): 2535-2546 (2011) - [j5]Souheib Baarir, Marco Beccuti
, Claude Dutheillet, Giuliana Franceschinis, Serge Haddad:
Lumping partially symmetrical stochastic models. Perform. Evaluation 68(1): 21-44 (2011)
2000 – 2009
- 2009
- [j4]Nawel Gharbi, Claude Dutheillet, Malika Ioualalen
Colored stochastic Petri nets for modelling and analysis of multiclass retrial systems. Math. Comput. Model. 49(7-8): 1436-1448 (2009) - [c11]Souheib Baarir, Marco Beccuti
From partially to fully lumped Markov chains in stochastic well formed Petri nets. VALUETOOLS 2009: 43 - 2005
- [c10]Souheib Baarir, Claude Dutheillet, Serge Haddad, Jean-Michel Ilié
On the use of exact lumpability in partially symmetricalWell-formed Nets. QEST 2005: 23-32 - 2004
- [c9]Jean-Michel Ilié
Extended SWN Solvers in GreatSPN. QEST 2004: 324-325 - 2003
- [c8]Yann Thierry-Mieg
Automatic Symmetry Detection in Well-Formed Nets. ICATPN 2003: 82-101 - 2001
- [j3]Lorenzo Capra
On the use of partial symmetries for lumping Markov chains. SIGMETRICS Perform. Evaluation Rev. 28(4): 33-35 (2001) - 2000
- [c7]Lorenzo Capra
Exploiting Partial Symmetries for Markov Chain Aggregation. MTCS 2000: 231-257
1990 – 1999
- 1999
- [c6]Lorenzo Capra
Towards Performance Analysis with Partially Symmetrical SWN. MASCOTS 1999: 148-155 - 1997
- [j2]Giovanni Chiola, Claude Dutheillet, Giuliana Franceschinis, Serge Haddad:
A Symbolic Reachability Graph for Coloured Petri Nets. Theor. Comput. Sci. 176(1-2): 39-65 (1997) - 1995
- [c5]Kamel Barkaoui, Jean-Michel Couvreur, Claude Dutheillet:
On Liveness in Extended non Self-Controlling Nets. Application and Theory of Petri Nets 1995: 25-44 - 1993
- [j1]Giovanni Chiola, Claude Dutheillet, Giuliana Franceschinis, Serge Haddad:
Stochastic Well-Formed Colored Nets and Symmetric Modeling Applications. IEEE Trans. Computers 42(11): 1343-1360 (1993) - [c4]Kamel Barkaoui, Claude Dutheillet, Serge Haddad:
An Efficient Algorithm for Finding Structural Deadlocks in Colored Petri Nets. Application and Theory of Petri Nets 1993: 69-88 - [c3]Claude Dutheillet, Serge Haddad:
Conflict sets in colored Petri nets. PNPM 1993: 76-85
1980 – 1989
- 1989
- [c2]Claude Dutheillet, Serge Haddad:
Regular stochastic Petri nets. Applications and Theory of Petri Nets 1989: 186-209 - [c1]Claude Dutheillet, Serge Haddad:
Aggregation of States in Colored Stochastic Petri Nets: Application to a Multiprocessor Architecture. PNPM 1989: 40-49
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-12-08 01:25 CET 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: