default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Amat
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Nicolas Amat, Silvano Dal-Zilio, Didier Le Botlan:
On the Complexity of Proving Polyhedral Reductions. Fundam. Informaticae 192(3-4): 363-394 (2024)- [c7]Nicolas Amat
, Silvano Dal-Zilio, Didier Le Botlan:
Project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability. VMCAI (1) 2024: 101-123 - [i7]Nicolas Amat, Silvano Dal-Zilio, Didier Le Botlan:
Project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability. CoRR abs/2401.03711 (2024) - 2023
- [b1]Nicolas Amat:
A polyhedral framework for reachability problems in Petri Nets. (Un cadre polyédrique pour les problèmes d'accessibilité dans les réseaux de Petri). INSA Toulouse, France, 2023 - [j3]Nicolas Amat, Silvano Dal-Zilio, Didier Le Botlan:
Leveraging polyhedral reductions for solving Petri net reachability problems. Int. J. Softw. Tools Technol. Transf. 25(1): 95-114 (2023) - [j2]Nicolas Amat, Pierre Bouvier, Hubert Garavel:
A Toolchain to Compute Concurrent Places of Petri Nets. Trans. Petri Nets Other Model. Concurr. 17: 1-26 (2023) - [c6]Nicolas Amat, Silvano Dal-Zilio, Didier Le Botlan:
Automated Polyhedral Abstraction Proving. Petri Nets 2023: 324-345 - [c5]Nicolas Amat, Silvano Dal-Zilio:
SMPT: A Testbed for Reachability Methods in Generalized Petri Nets. FM 2023: 445-453 - [i6]Nicolas Amat, Silvano Dal-Zilio, Didier Le Botlan:
Leveraging polyhedral reductions for solving Petri net reachability problems. CoRR abs/2302.02686 (2023) - [i5]Nicolas Amat, Silvano Dal-Zilio:
SMPT: A Testbed for Reachability Methods in Generalized Petri Nets. CoRR abs/2302.14741 (2023) - [i4]Nicolas Amat, Silvano Dal-Zilio, Didier Le Botlan:
Automated Polyhedral Abstraction Proving. CoRR abs/2306.01466 (2023) - 2022
- [j1]Nicolas Amat, Bernard Berthomieu, Silvano Dal-Zilio:
A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking. Fundam. Informaticae 187(2-4): 103-138 (2022) - [c4]Nicolas Amat, Louis Chauvet:
Kong: A Tool to Squash Concurrent Places. Petri Nets 2022: 115-126 - [c3]Nicolas Amat, Silvano Dal-Zilio, Thomas Hujsa:
Property Directed Reachability for Generalized Petri Nets. TACAS (1) 2022: 505-523 - [i3]Nicolas Amat, Silvano Dal-Zilio, Thomas Hujsa:
Property Directed Reachability for Generalized Petri Nets. CoRR abs/2208.03043 (2022) - 2021
- [c2]Nicolas Amat, Bernard Berthomieu, Silvano Dal-Zilio:
On the Combination of Polyhedral Abstraction and SMT-Based Model Checking for Petri Nets. Petri Nets 2021: 164-185 - [c1]Nicolas Amat, Silvano Dal-Zilio, Didier Le Botlan:
Accelerating the Computation of Dead and Concurrent Places Using Reductions. SPIN 2021: 45-62 - [i2]Nicolas Amat, Bernard Berthomieu, Silvano Dal-Zilio:
On the Combination of Polyhedral Abstraction and SMT-based Model Checking for Petri nets. CoRR abs/2104.09850 (2021) - [i1]Nicolas Amat, Silvano Dal-Zilio, Didier Le Botlan:
Accelerating the Computation of Dead and Concurrent Places using Reductions. CoRR abs/2106.12813 (2021)
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-04 21:02 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:
