Priced Timed Petri Nets

DOI10.2168/LMCS-9(4:10)2013zbMath1314.68199arXiv1307.2570OpenAlexW2110309174MaRDI QIDQ2865063

Parosh Aziz Abdulla, Richard Mayr

Publication date: 28 November 2013

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

Petri netsformal verificationtimed automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

Parameter Synthesis for Bounded Cost Reachability in Time Petri Nets ⋮ Cost-optimal timed trace synthesis for scheduling of intermittent embedded systems ⋮ Unnamed Item ⋮ Cost Problems for Parametric Time Petri Nets*

This page was built for publication: Priced Timed Petri Nets