( en | de | ru )

 

Disambiguation of "Larsen, Kim Guldstrand"

Author of the publication

copydeleteadd this publication to your clipboard
Optimal Bounds for Multiweighted and Parametrised Energy Games.

, , and . Theories of Programming and Formal Methods, volume 8051 of Lecture Notes in Computer Science, page 244-255. Springer, (2013)

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.

Reinhard Larsen

Jürgen Larsen

Patrick Larsen

Larsen Schütte

Claudia Larsen

 

Other publications of authors with the same name

Reasoning About Bounds in Weighted Transition Systems., , , and . Logical Methods in Computer Science, (2018)Decidability and Expressiveness of Recursive Weighted Logic., , and . Ershov Memorial Conference, volume 8974 of Lecture Notes in Computer Science, page 216-231. Springer, (2014)Stubborn Set Reduction for Two-Player Reachability Games., , , , and . CoRR, (2019)Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction., , and . Fundam. Informaticae, 178 (1-2): 31-57 (2021)CMC: A Tool for Compositional Model-Checking of Real-Time Systems., and . FORTE, volume 135 of IFIP Conference Proceedings, page 439-456. Kluwer, (1998)Practical controller synthesis for MTL0, ∞., , , , and . SPIN, page 102-111. ACM, (2017)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)CyNC: A method for real time analysis of systems with cyclic data flows., , , and . J. Embed. Comput., 2 (3-4): 347-360 (2006)Formal Verification of a Power Controller Using the Real-Time Model Checker UPPAAL., , and . ARTS, volume 1601 of Lecture Notes in Computer Science, page 277-298. Springer, (1999)Optimal Conditional Reachability for Multi-priced Timed Automata., and . FoSSaCS, volume 3441 of Lecture Notes in Computer Science, page 234-249. Springer, (2005)