Modeling a Language for Embedded Systems in Timed Automata

We present a compositional method for translating real-timeprograms into networks of timed automata. Programs are written in anassembly like real-time language and translated into models supportedby the tool Uppaal. We have implemented the translation and give anexample of its application on a simple control program for a car. Someproperties of the behavior of the control program are verified using thegenerated model

Linear Parametric Model Checking of Timed Automata

We present an extension of the model checker Uppaal capable of synthesizing linear parameter constraints for the correctness ofparametric timed automata. The symbolic representation of the (parametric) state-space is shown to be correct. A second contribution of thispaper is the identification of a subclass of parametric timed automata(L/U automata), for which the emptiness problem is decidable, contraryto the full class where it is know to be undecidable. Also we present anumber of lemmas enabling the verification effort to be reduced for L/Uautomata in some cases. We illustrate our approach by deriving linearparameter constraints for a number of well-known case studies from theliterature (exhibiting a flaw in a published paper)

Language Emptiness of Continuous-Time Parametric Timed Automata

Parametric timed automata extend the standard timed automata with the possibility to use parameters in the clock guards. In general, if the parameters are real-valued, the problem of language emptiness of such automata is undecidable even for various restricted subclasses. We thus focus on the case where parameters are assumed to be integer-valued, while the time still remains continuous. On the one hand, we show that the problem remains undecidable for parametric timed automata with three clocks and one parameter. On the other hand, for the case with arbitrary many clocks where only one of these clocks is compared with (an arbitrary number of) parameters, we show that the parametric language emptiness is decidable. The undecidability result tightens the bounds of a previous result which assumed six parameters, while the decidability result extends the existing approaches that deal with discrete-time semantics only. To the best of our knowledge, this is the first positive result in the case of continuous-time and unbounded integer parameters, except for the rather simple case of single-clock automata

Minimum-Cost Reachability for Priced Timed Automata

This paper introduces the model of linearly priced timed automata as an extension of timed automata, with prices on both transitions and locations. For this model we consider the minimum-cost reachability problem: i.e. given a linearly priced timed automaton and a targetstate, determine the minimum cost of executions from the initial state to the target state. This problem generalizes the minimum-time reachability problem for ordinary timed automata. We prove decidability of this problem by offering an algorithmic solution, which is based on a combination of branch-and-bound techniques and a new notion of priced regions. The latter allows symbolic representation and manipulation of reachable states together with the cost of reaching them.Keywords: Timed Automata, Verification, Data Structures, Algorithms,Optimization

LTL Parameter Synthesis of Parametric Timed Automata

The parameter synthesis problem for parametric timed automata is undecidable in general even for very simple reachability properties. In this paper we introduce restrictions on parameter valuations under which the parameter synthesis problem is decidable for LTL properties. The investigated bounded integer parameter synthesis problem could be solved using an explicit enumeration of all possible parameter valuations. We propose an alternative symbolic zone-based method for this problem which results in a faster computation. Our technique extends the ideas of the automata-based approach to LTL model checking of timed automata. To justify the usefulness of our approach, we provide experimental evaluation and compare our method with explicit enumeration technique.Comment: 23 pages, extended versio

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 an extension of the (priced) timed automata model that includes both costs and rewards as separate modelling features. A precise definition is then given of what constitutes optimal infinite behaviours for this class of models. We subsequently show that the derivation of optimal non-terminating schedules for such double-priced timed automata is computable. This is done by a reduction of the problem to the determination of optimal mean-cycles in finite graphs with weighted edges. This reduction is obtained by introducing the so-called corner-point abstraction, a powerful abstraction technique of which we show that it preserves optimal schedules

Probabilistic Reachability for Parametric Markov Models

Abstract. Given a parametric Markov model, we consider the problem of computing the formula expressing the probability of reaching a given set of states. To attack this principal problem, Daws has suggested to first convert the Markov chain into a finite automaton, from which a regular expression is computed. Afterwards, this expression is evaluated to a closed form expression representing the reachability probability. This paper investigates how this idea can be turned into an effective procedure. It turns out that the bottleneck lies in an exponential growth of the regular expression relative to the number of states. We therefore proceed differently, by tightly intertwining the regular expression computation with its evaluation. This allows us to arrive at an effective method that avoids the exponential blow up in most practical cases. We give a detailed account of the approach, also extending to parametric models with rewards and with non-determinism. Experimental evidence is provided, illustrating that our implementation provides meaningful insights on non-trivial models.

General Synthesis Report of the Different ADS Design Status. Establishment of a Catalogue of the R&D needs

This document is a General Synthesis Report of the Different ADS Design Status being designed within the EUROTRANS Integrated Project; an FP6 European commission partially funded programme. This project had the goal to demonstrate the possibility of nuclear waste transmutation/burning in Accelerator Driven Systems (ADS) at industrial scale.The focus is on a Pb-cooled ADS for the European Facility on Industrial scale Transmuter (ETD/EFIT) with a back-up solution based on an He cooled ADS.As an intermediate step towards this industrial-scale prototype, an eXperimental Transmuter based on ADS concept (ETD/XT-ADS) able to demonstrate both the feasibility of the ADS concept and to accumulate experience when using dedicated fuel sub-assemblies or dedicated pins within a MOX fuel core has been also studied.The two machines (XT-ADS and Pb cooled EFIT) have been designed in a consistent way bringing more credibility to the potential licensing of these plants and with sufficient details to allow definition of the critical issues as regards design, safety and associated technological and basic R&D needs. The different designs fit rather well with the technical objectives fixed at the beginning of the project in consistency with the European Roadmap on ADS development.For what concerns the accelerator, the superconducting LINAC has been clearly assessed as the most suitable concept for the three reactors in particular with respect to the stringent requirements on reliability. Associated R&D needs have been identified and will be focused on critical components (injector, cryomodule) long term testing.The design of the different ADS has been performed in view of what is reasonably achievable pending the completion of R&D programmes. The way the EUROTRANS Integrated Project has been organised with other domains than the DM1 Design being specifically devoted to R&D tasks in support to the overall ETD/EFIT and ETD/XT-ADS design tasks has been helpful. The other domains were centred on the assessment of reactivity measurement techniques (DM2 ECATS), on the development of U-free dedicated fuels (DM3 AFTRA), on materials behaviour and heavy liquid metal technology (DM4 DEMETRA) and on nuclear data assessment (DM5 NUDATRA). Pending questions associated to technology gaps have been identified through the different appropriate R&D work programmes and a Catalogue of the R&D needs has been established.Finally, the work within the EUROTRANS integrated project has provided an overall assessment of the feasibility at a reasonable cost for an ADS based transmutation so that a decision can be taken to launch a detailed design and construction of the intermediate step Experimental ADS now already launched within the 7th FP programme under the name of Common Design Team (CDT)

Bounded Model Checking for Parametric Timed Automata

Abstract. The paper shows how bounded model checking can be ap-plied to parameter synthesis for parametric timed automata with con-tinuous time. While it is known that the general problem is undecidable even for reachability, we show how to synthesize a part of the set of all the parameter valuations under which the given property holds in a model. The results form a complete theory which can be easily applied to parametric verification of a wide range of temporal formulae – we present such an implementation for the existential part of CTL −X. 1 Introduction and related work The growing abundance of complex systems in real world, and their presence in critical areas fuels the research in formal specification and analysis. One of the established methods in systems verification is model checking, where the system is abstracted into the algebraic model (e.g. various versions of Kripke structures