Author of the publication

As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata.

, , , , , , and . CAV, volume 2102 of Lecture Notes in Computer Science, page 493-505. Springer, (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Realizability Criteria for Compositional MSC., , and . AMAST, volume 4019 of Lecture Notes in Computer Science, page 248-262. Springer, (2006)Minimum-Cost Reachability for Priced Timed Automata., , , , , , and . HSCC, volume 2034 of Lecture Notes in Computer Science, page 147-161. Springer, (2001)Exploiting Symmetry in Protocol Testing., and . FORTE, volume 135 of IFIP Conference Proceedings, page 337-352. Kluwer, (1998)Preface., , and . IFM Doctoral Symposium, volume 191 of Electronic Notes in Theoretical Computer Science, page 1-2. Elsevier, (2005)Founding FireWire Bridges through Promela Prototyping., , and . IPDPS, page 239. IEEE Computer Society, (2003)Non-local Choice and Beyond: Intricacies of MSC Choice Nodes., , and . FASE, volume 3442 of Lecture Notes in Computer Science, page 273-288. Springer, (2005)Linear Parametric Model Checking of Timed Automata., , , and . TACAS, volume 2031 of Lecture Notes in Computer Science, page 189-203. Springer, (2001)Guiding Spin Simulation., and . ICFEM, volume 3308 of Lecture Notes in Computer Science, page 176-193. Springer, (2004)As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata., , , , , , and . CAV, volume 2102 of Lecture Notes in Computer Science, page 493-505. Springer, (2001)Assertion-Based Proof Checking of Chang-Roberts Leader Election in PVS., , and . ATVA, volume 4762 of Lecture Notes in Computer Science, page 347-361. Springer, (2007)