Acceleration for Petri nets

DOI10.1007/978-3-319-02444-8_1MaRDI QIDQ5166672zbMATH OpenOpenAlexFDO

Authors Jérôme Leroux

Publication date 8 July 2014

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-02444-8_1

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Presburger vector addition systems
• Decidability of the Petri net reachability problem
• The reachability problem for Petri nets is not elementary
• Flat Petri nets (invited talk)
• An Algorithm for the General Petri Net Reachability Problem

Cited in

(5)

• Flat Petri nets (invited talk)
• Model-checking for resource-bounded ATL with production and consumption of resources
• scientific article; zbMATH DE number 1954380 (Why is no real title available?)
• Presburger vector addition systems
• Proving safety properties of infinite state systems by compilation into Presburger arithmetic

This page was built for publication: Acceleration for Petri nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166672)