On Functions Weakly Computable by Petri Nets and Vector Addition Systems

DOI10.1007/978-3-319-11439-2_15zbMath1448.68346OpenAlexW166893320MaRDI QIDQ3447705

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

Mathematics Subject Classification ID

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

Related Items (3)

Unnamed Item ⋮ Dynamic Recursive Petri Nets ⋮ The ideal view on Rackoff's coverability technique

This page was built for publication: On Functions Weakly Computable by Petri Nets and Vector Addition Systems