Model checking real-time systems
This chapter surveys timed automata as a formalism for model checking real-time systems.
We begin with introducing the model, as an extension of finite-state automata with real …
We begin with introducing the model, as an extension of finite-state automata with real …
Infinite runs in weighted timed automata with energy constraints
We study the problems of existence and construction of infinite schedules for finite weighted
automata and one-clock weighted timed automata, subject to boundary constraints on the …
automata and one-clock weighted timed automata, subject to boundary constraints on the …
Decision problems for timed automata: A survey
Finite automata and regular languages have been useful in a wide variety of problems in
computing, communication and control, including formal modeling and verification …
computing, communication and control, including formal modeling and verification …
Optimal scheduling using priced timed automata
G Behrmann, KG Larsen, JI Rasmussen - ACM SIGMETRICS …, 2005 - dl.acm.org
This contribution reports on the considerable effort made recently towards extending and
applying well-established timed automata technology to optimal scheduling and planning …
applying well-established timed automata technology to optimal scheduling and planning …
Priced timed automata: Algorithms and applications
G Behrmann, KG Larsen, JI Rasmussen - International symposium on …, 2004 - Springer
This contribution reports on the considerable effort made recently towards extending and
applying well-established timed automata technology to optimal scheduling and planning …
applying well-established timed automata technology to optimal scheduling and planning …
Optimal strategies in priced timed game automata
Priced timed (game) automata extend timed (game) automata with costs on both locations
and transitions. In this paper we focus on reachability priced timed game automata and …
and transitions. In this paper we focus on reachability priced timed game automata and …
On the optimal reachability problem of weighted timed automata
We study the cost-optimal reachability problem for weighted timed automata such that
positive and negative costs are allowed on edges and locations. By optimality, we mean an …
positive and negative costs are allowed on edges and locations. By optimality, we mean an …
Optimal infinite scheduling for multi-priced timed automata
This paper is concerned with the derivation of infinite schedules for timed automata that are
in some sense optimal. To cover a wide class of optimality criteria we start out by introducing …
in some sense optimal. To cover a wide class of optimality criteria we start out by introducing …
Quantitative analysis of weighted transition systems
We present a general framework for the analysis of quantitative and qualitative properties of
reactive systems, based on a notion of weighted transition systems. We introduce and …
reactive systems, based on a notion of weighted transition systems. We introduce and …
Quantifying similarities between timed systems
We define quantitative similarity functions between timed transition systems that measure
the degree of closeness of two systems as a real, in contrast to the traditional boolean …
the degree of closeness of two systems as a real, in contrast to the traditional boolean …