Cost Problems for Parametric Time Petri Nets*

DOI10.3233/FI-2021-2083OpenAlexW4205191920MaRDI QIDQ5025060

Olivier H. Roux, Didier Lime, Charlotte Seidner

Publication date: 1 February 2022

Published in: Fundamenta Informaticae (Search for Journal in Brave)

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

zbMATH Keywords

parametersreachabilityoptimalitytime Petri netscost

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items (1)

Cost-optimal timed trace synthesis for scheduling of intermittent embedded systems

Uses Software

• AUTOSAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal paths in weighted timed automata
• A theory of timed automata
• Optimal reachability in cost time Petri nets
• Linear parametric model checking of timed automata
• Not necessarily closed convex polyhedra and the double description method
• Priced Timed Petri Nets
• Symbolic Optimal Reachability in Weighted Timed Automata
• Model-checking for real-time systems
• Parametric real-time reasoning
• Automated Technology for Verification and Analysis

This page was built for publication: Cost Problems for Parametric Time Petri Nets*