On functions weakly computable by Petri nets and vector addition systems

DOI10.1007/978-3-319-11439-2_15zbMATH Open1448.68346OpenAlexW166893320MaRDI QIDQ3447705FDOQ3447705

Authors: Jérôme Leroux, Philippe Schnoebelen 

Publication date: 28 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-11439-2_15

Recommendations

• On functions weakly computable by pushdown Petri nets and related systems
• On growth function of Petri net
• scientific article; zbMATH DE number 4037227
• An Algorithm for the General Petri Net Reachability Problem
• A multiparameter analysis of the boundedness problem for vector addition systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (5)

• The ideal view on Rackoff's coverability technique
• Dynamic Recursive Petri Nets
• On functions weakly computable by pushdown Petri nets and related systems
• Fast termination and workflow nets
• On growth function of Petri net

This page was built for publication: On functions weakly computable by Petri nets and vector addition systems

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