Continuous reachability for unordered data Petri nets is in PTime

DOI10.1007/978-3-030-17127-8_15OpenAlexW2912654482MaRDI QIDQ2289079

S. Akshay, Piotr Hofman, Utkarsh Gupta, Preey Shah

Publication date: 28 January 2020

Full work available at URL: https://arxiv.org/abs/1902.05604

zbMATH Keywords

Petri netspolynomial timecontinuous reachabilityunordered data

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (2)

Linear equations for unordered data vectors in $[D^k\to{}Z^d$] ⋮ Directed reachability for infinite-state systems

This page was built for publication: Continuous reachability for unordered data Petri nets is in PTime