The Logical View on Continuous Petri Nets

DOI10.1145/3105908zbMath1407.68329OpenAlexW2745248131MaRDI QIDQ5369247

Serge Haddad, Michael Blondin, Christoph Haase, Alain Finkel

Publication date: 16 October 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://discovery.ucl.ac.uk/id/eprint/10088921/

zbMATH Keywords

linear programmingPetri netscoverabilityvector addition systemsarithmetic theories

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (7)

Dynamic Recursive Petri Nets ⋮ Separators in Continuous Petri Nets ⋮ Separators in continuous Petri nets ⋮ Population protocols: beyond runtime analysis ⋮ Directed reachability for infinite-state systems ⋮ Commodification of accelerations for the Karp and Miller construction ⋮ Unnamed Item

This page was built for publication: The Logical View on Continuous Petri Nets