2012 - Member of Academia Europaea
Kim Guldstrand Larsen mostly deals with Automaton, Theoretical computer science, Algorithm, Programming language and Reachability. Kim Guldstrand Larsen interconnects Formal verification, Real-time computing, State and Hybrid system in the investigation of issues within Automaton. His research integrates issues of Discrete mathematics and Semantics in his study of Theoretical computer science.
His Algorithm research incorporates themes from Characterization, Probabilistic logic, Representation and Concurrency. His Programming language study combines topics in areas such as Transformation and Simulation. His studies deal with areas such as Distributed computing and Game theory as well as Reachability.
Theoretical computer science, Automaton, Model checking, Algorithm and Programming language are his primary areas of study. Kim Guldstrand Larsen has included themes like Probabilistic logic and Correctness in his Theoretical computer science study. His primary area of study in Probabilistic logic is in the field of Probabilistic automaton.
His research in Automaton intersects with topics in Decidability, Semantics, State and Reachability. His Model checking study incorporates themes from Distributed computing, Formal verification, Real-time computing, Scheduling and Data structure. Kim Guldstrand Larsen studies Algorithm, focusing on Computation in particular.
Kim Guldstrand Larsen mainly focuses on Model checking, Theoretical computer science, Automaton, Algorithm and Reachability. His research on Model checking also deals with topics like
Distributed computing most often made with reference to Scheduling,
Dependency graph, which have a strong connection to Dependency. His Theoretical computer science research also works with subjects such as
Petri net which intersects with area such as Fixed point,
Probabilistic logic that connect with fields like Semantics.
Kim Guldstrand Larsen has researched Automaton in several fields, including Decidability, Programming language, Control theory and TRACE. His Decidability research includes elements of Bisimulation, Finite model property and Transition system. Kim Guldstrand Larsen combines topics linked to Bounded function with his work on Algorithm.
Kim Guldstrand Larsen focuses on Model checking, Theoretical computer science, Automaton, Algorithm and Petri net. Kim Guldstrand Larsen combines subjects such as Set, Reachability, Dependency graph, Computation and Probabilistic CTL with his study of Model checking. The various areas that Kim Guldstrand Larsen examines in his Theoretical computer science study include Fixed point, Discrete time and continuous time, Correctness, Property and Probabilistic logic.
His Automaton research is multidisciplinary, incorporating perspectives in Computer security, Model-based testing, Test case, TRACE and Cloud computing. The study incorporates disciplines such as Programming language and Verification problem in addition to TRACE. His work carried out in the field of Algorithm brings together such families of science as Test suite and Bisimulation.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
UPPAAL in a Nutshell
Kim Guldstrand Larsen;Paul Pettersson;Wang Yi.
International Journal on Software Tools for Technology Transfer (1997)
A Tutorial on UPPAAL
Gerd Behrmann;Alexandre David;Kim Guldstrand Larsen.
formal methods (2004)
Bisimulation through probabilistic testing
Kim G. Larsen;Arne Skou.
Information & Computation (1991)
UPPAAL—a tool suite for automatic verification of real-time systems
J. Bengtsson;Kim Guldstrand Larsen;F. Larsson;P. Pettersson.
BRICS Report Series (1996)
A modal process logic
K.G. Larsen;B. Thomsen.
logic in computer science (1988)
G. Behrmann;A. David;K.G. Larsen;J. Hakansson.
quantitative evaluation of systems (2006)
Minimum-Cost Reachability for Priced Timed Automata
Gerd Behrmann;Ansgar Fehnker;Thomas Hune;Kim Guldstrand Larsen.
acm international conference hybrid systems computation and control (2001)
Specification and refinement of probabilistic processes
B. Jonsson;K.G. Larsen.
logic in computer science (1991)
Reactive Systems: Modelling, Specification and Verification
Luca Aceto;Anna Ingólfsdóttir;Kim Guldstrand Larsen;Jiri Srba.
Kim Guldstrand Larsen.
Proceedings of the international workshop on Automatic verification methods for finite state systems (1989)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: