• Publications
  • Influence
Minimum-Cost Reachability for Priced Timed Automata
TLDR
This paper introduces the model of linearly priced timed automaton as an extension of timed automata, with prices on both transitions and locations. Expand
  • 357
  • 27
  • PDF
Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems
TLDR
This paper presents a new procedure to perform this refinement operation for abstractions of hybrid systems. Expand
  • 211
  • 12
  • PDF
Benchmarks for Hybrid Systems Verification
TLDR
This paper introduces some problems that we propose as benchmarks for evaluating and comparing tools for hybrid system design and verification. Expand
  • 178
  • 12
  • PDF
Efficient Guiding Towards Cost-Optimality in UPPAAL
TLDR
In this paper we present an algorithm for efficiently computing the minimum cost of reaching a goal state in the model of Uniformly Priced Timed Automata (UPTA). Expand
  • 163
  • 11
  • PDF
Verification of Hybrid Systems Based on Counterexample-Guided Abstraction Refinement
TLDR
We showhowsuch reachability computations with varying degrees of complexity can be used to refine hybrid system abstractions efficiently. Expand
  • 116
  • 11
  • PDF
Modelling and Verification of the LMAC Protocol for Wireless Sensor Networks
TLDR
We report on modelling and verification of a medium access control protocol for wireless sensor networks, the LMAC protocol. Expand
  • 107
  • 11
  • PDF
UPPAAL - Now, Next, and Future
TLDR
UPPAAL is a tool for modeling, simulation and verification of real-time systems, developed jointly by BRICS at Aalborg University and the Department of Computer Systems at Uppsala University. Expand
  • 133
  • 9
  • PDF
As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata
TLDR
In this paper we present an algorithm for efficiently computing optimal cost of reaching a goal state in the model of Linearly Priced Timed Automata (LPTA). Expand
  • 166
  • 7
  • PDF
Tools and Algorithms for the Construction and Analysis of Systems
TLDR
Combining model checking and deduction for I/O- automata.- A constraint oriented proof methodology based on modal transition systems.- A user guide to HyTech. Expand
  • 151
  • 5
Scheduling a steel plant with timed automata
  • A. Fehnker
  • Computer Science
  • Proceedings Sixth International Conference on…
  • 13 December 1999
TLDR
We tackle this problem for an integrated steel plant in Ghent, Belgium, using UPPAAL, a model checker for networks of timed automata. Expand
  • 131
  • 5
  • PDF