As Cheap as Possible: Effcient Cost-Optimal Reachability for Priced Timed Automata
Lecture notes in computer science2001pp. 493–505
Citations Over TimeTop 10% of 2001 papers
Kim G. Larsen, Gerd Behrmann, Ed Brinksma, Ansgar Fehnker, Thomas Hune, Paul Pettersson, Judi Romijn
Related Papers
- → SimpleCAR: An Efficient Bug-Finding Tool Based on Approximate Reachability(2018)17 cited
- → The complexity of reachability in distributed communicating processes(1988)19 cited
- → Recent Advances on Reachability Problems for Valence Systems (Invited Talk)(2021)2 cited
- → The complexity of reachability in distributed communicating processes(1988)2 cited
- → Unfolding Based Algorithms for the Reachability Problem(2001)