Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems

International audienceThis article aims at providing a concise and precise Travellers Guide, Phrase Book or Reference Manual to the timed automata modeling formalism introduced by Alur and Dill [8, 9]. The paper gives comprehensive definitions of timed automata, priced (or weighted) timed automata, and timed games and highlights a number of results on associated decision problems related to model checking, equivalence checking, optimal scheduling, the existence of winning strategies, and then statistical model checking

As Soon as Probable: Optimal Scheduling under Stochastic Uncertainty

Abstract. In this paper we continue our investigation of stochastic (and hence dynamic) variants of classical scheduling problems. Such problems can be modeled as duration probabilistic automata (DPA), a well-structured class of acyclic timed automata where temporal uncertainty is interpreted as a bounded uniform distribution of task durations [18]. In [12] we have developed a framework for computing the expected performance of a given scheduling policy. In the present paper we move from analysis to controller synthesis and develop a dynamicprogramming style procedure for automatically synthesizing (or approximating) expected time optimal schedulers, using an iterative computation of a stochastic time-to-go function over the state and clock space of the automaton.

4-Diphenylphosphanyl-1,5-naphthyridine

The asymmetric unit of the title compound, C20H15N2P, contains two independent molecules with similar structures. The 1,5-naphthyridine ring system is nearly planar, with maximum deviations of 0.010 (3) and 0.012 (3) Å; its mean plane is oriented with respect to the two phenyl rings at 79.69 (12) and 84.00 (10)° in one molecule, and at 74.25 (12) and 82.05 (11)° in the other. The two phenyl rings are twisted with respect to each other with a dihedral angle of 75.96 (14)° in one molecule and 86.30 (13)° in the other

Economic values of biodiversity

No abstract available

From MITL to timed automata

We show how to transform formulae written in the real-time temporal logic MITL into timed automata that recognize their satisfying models. This compositional construction is much simpler than previously known and can be easily implemented

Economic values of biodiversity

No abstract available