Leveraging polyhedral reductions for solving Petri net reachability problems

Nicolas Amat, Silvano Dal Zilio, Didier Le Botlan

Open source

DOI: 10.1007/s10009-022-00694-8
Published: 2022-12-22
Container: International Journal on Software Tools for Technology Transfer
Publisher: Springer Science and Business Media LLC
Open access: unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

supportingDOI registered: A matching record was returned by Crossref. Source: Crossref; license: CC0 metadata
supportingDOI resolves: A matching record was returned by Crossref. Source: Crossref; license: CC0 metadata
not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility. Source: DOAJ; license: CC0
not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredROR affiliation: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredOpen access status: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication license: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication version: A publication version was supplied but is not scored. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
supportingMetadata completeness: All 6 scored descriptive metadata groups are present. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer

Cite this work

BibTeX

@article{allodium:10.1007/s10009-022-00694-8,
  title = {Leveraging polyhedral reductions for solving Petri net reachability problems},
  author = {Nicolas Amat and Silvano Dal Zilio and Didier Le Botlan},
  year = {2022},
  journal = {International Journal on Software Tools for Technology Transfer},
  doi = {10.1007/s10009-022-00694-8},
  url = {https://doi.org/10.1007/s10009-022-00694-8}
}

RIS

TY  - JOUR
TI  - Leveraging polyhedral reductions for solving Petri net reachability problems
AU  - Nicolas Amat
AU  - Silvano Dal Zilio
AU  - Didier Le Botlan
PY  - 2022
JO  - International Journal on Software Tools for Technology Transfer
DO  - 10.1007/s10009-022-00694-8
UR  - https://doi.org/10.1007/s10009-022-00694-8
ER  -

APA

Amat, N., Zilio, S. D., & Botlan, D. L. (2022). Leveraging polyhedral reductions for solving Petri net reachability problems. International Journal on Software Tools for Technology Transfer. https://doi.org/10.1007/s10009-022-00694-8

Source records

crossref · retrieved 2026-09-25T12:33:13.290Z