Continuous reachability for unordered data Petri nets is in PTime

DOI10.1007/978-3-030-17127-8_15MaRDI QIDQ2289079zbMATH OpenOpenAlexFDO

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

Publication date 28 January 2020

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

continuous reachabilityPetri netspolynomial timeunordered data

Mathematics Subject Classification ID

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

Recommendations

• On persistent reachability in Petri nets
• Decidability and complexity of Petri nets with unordered data
• From Time Petri Nets to Timed Automata: An Untimed Approach
• Timing and liveness in continuous Petri nets
• Controllability of timed continuous Petri nets with uncontrollable transitions
• Decidable classes of unbounded Petri nets with time and urgency
• On persistency in time Petri nets
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• On reachability in autonomous continuous Petri net systems
• Efficient Reachability Analysis for Time Petri Nets

Cited in

(4)

• Directed reachability for infinite-state systems
• Linear equations for unordered data vectors in $[D]^k\to{}Z^d$
• Solvability of orbit-finite systems of linear equations
• Orbit-finite linear programming

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

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