An extension of the inverse method to probabilistic timed automata
نویسندگان
چکیده
منابع مشابه
An Extension of the Inverse Method to Probabilistic Timed Automata
Probabilistic timed automata can be used to model systems in which probabilistic and timing behaviour coexist. Verification of probabilistic timed automata models is generally performed with regard to a single reference valuation π0 of the timing parameters. Given such a parameter valuation, we present a method for obtaining automatically a constraint K0 on timing parameters for which the reach...
متن کاملAn Inverse Method for Parametric Timed Automata
Given a timed automaton with parametric timings, our objective is to describe a procedure for deriving constraints on the parametric timings in order to ensure that, for each value of parameters satisfying these constraints, the behaviors of the timed automata are time-abstract equivalent. We will exploit a reference valuation of the parameters that is supposed to capture a characteristic prope...
متن کاملConcavely-Priced Probabilistic Timed Automata
Concavely-priced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, and average price problems for concavely-priced probabilistic timed automata for arbitrary initial states. We prove that these problems are EXPTIME-complete for probabilistic timed automata with two or more clocks and PTIME-com...
متن کاملModel Checking Probabilistic Timed Automata
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic timed automata which have one or two clocks. Firstly, we show that PCTL probabilistic model-checking problems (such as determining whether a set of target states can be reached with probability at least 0.99 regardless...
متن کاملTransformation of MTCCS into an Extension of Timed Automata
This paper presents results from work in progress on finding a method for specification and formal verification of realtime concurrent systems incorporating a non-trivial data component. To model such systems, we use the real-time process algebra MTCCS, a Timed CCS variant, enhanced with a data manipulation model. Our verification method is based on the dual-language approach in which temporal ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Methods in System Design
سال: 2012
ISSN: 0925-9856,1572-8102
DOI: 10.1007/s10703-012-0169-x