Minimal Cost Reachability/Coverability in Priced Timed Petri Nets

DOI10.1007/978-3-642-00596-1_25zbMath1234.68280OpenAlexW2117101148MaRDI QIDQ3617740

Parosh Aziz Abdulla, Richard Mayr

Publication date: 31 March 2009

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00596-1_25

Mathematics Subject Classification ID

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

Related Items (2)

Parameterized model checking of weighted networks ⋮ How to Tackle Integer Weighted Automata Positivity

Cites Work

• The residue of vector sets with applications to decidability problems in Petri nets
• Decidability of a temporal logic problem for Petri nets
• A theory of timed automata
• On the optimal reachability problem of weighted timed automata
• An Algorithm for the General Petri Net Reachability Problem
• Recoverability of Communication Protocols--Implications of a Theoretical Study
• Reachability in Petri Nets with Inhibitor Arcs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimal Cost Reachability/Coverability in Priced Timed Petri Nets