Parameter Synthesis for Bounded Cost Reachability in Time Petri Nets

DOI10.1007/978-3-030-21571-2_22OpenAlexW2950986955MaRDI QIDQ6144225

Charlotte Seidner, Didier Lime, Olivier H. Roux

Publication date: 29 January 2024

Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-21571-2_22

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

An algorithm for single-source shortest paths enumeration in parameterized weighted graphs

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item