ویراساینس.
سند علمی

Stochastic Semantics and Statistical Model Checking for Networks of Priced Timed Automata

Alexandre David, Kim G. Larsen, Axel Legay, Marius Mikucionis, Danny Bøgsted Poulsen, Jonas van Vliet, Zheng Wang

چکیده

This paper offers a natural stochastic semantics of Networks of Priced Timed Automata (NPTA) based on races between components. The semantics provides the basis for satisfaction of Probabilistic Weighted CTL properties (PWCTL), conservatively extending the classical satisfaction of timed automata with respect to TCTL. In particular the extension allows for hard real-time properties of timed automata expressible in TCTL to be refined by performance properties, e.g. in terms of probabilistic guarantees of timeand cost-bounded properties. A second contribution of the paper is the application of Statistical Model Checking (SMC) to efficiently estimate the correctness of non-nested PWCTL model checking problems with a desired level of confidence, based on a number of independent runs of the NPTA. In addition to applying classical SMC algorithms, we also offer an extension that allows to efficiently compare performance properties of NPTAs in a parametric setting. The third contribution is an efficient tool implementation of our result and applications to several case studies.

اسناد مشابه

  • UPPAAL-SMC: Statistical Model Checking for Priced Timed Automata

    سند علمی۲۰۱۲QAPLPeter E. Bulychev, Alexandre David, Kim G. Larsen, Marius Mikucionis

    This paper offers a survey of UPPAAL-SMC, a major extension of the real-time verification tool UPPAAL. UPPAAL-SMC allows for the efficient analysis of performance properties of networks of priced timed automata under a natural stochastic semantics. In particular, UPPAAL-SMC relie

  • Model-Checking for Weighted Timed Automata

    سند علمی۲۰۰۴FORMATS/FTRTFTThomas Brihaye, Véronique Bruyère, Jean-François Raskin

    We study the model-checking problem for weighted timed automata and the weighted CTL logic by the bisimulation approach. Weighted timed automata are timed automata extended with costs on both edges and locations. When the costs act as stopwatches, we get stopwatch automata with t

  • Simple Bounded MTL Model Checking for Discrete Timed Automata (extended abstract)

    سند علمی۲۰۱۶CS&PAgnieszka Zbrzezny, Andrzej Zbrzezny

    We present a new translation of Metric Temporal Logic to the Linear Temporal Logic with a new set of the atomic propositions. We investigate a SAT-based bounded model checking method for Metric Temporal Logic that is interpreted over linear discrete infinite time models generated

  • Symbolic Model Checking of Probabilistic Timed Automata Using Backwards Reachability

    سند علمی۲۰۰۰Marta Kwiatkowska, Gethin Norman

    We consider probabilistic timed automata of [13], an extension of the timed automata model of [2] with discrete probability distributions. In contrast to timed automata, which model real-time systems purely in terms of nondeterminism, our model allows to express the likelihood of

  • Symbolic Model Checking for Probabilistic Timed Automata

    سند علمی۲۰۰۴Inf. Comput.Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sproston, Fuzhi Wang

    Probabilistic timed automata are an extension of timed automata with discrete probability distributions, and can be used to model timed randomized protocols or fault-tolerant systems. We present symbolic model checking algorithms for probabilistic timed automata to verify qualita

  • LTL Model Checking of Parametric Timed Automata

    سند علمی۲۰۱۴CoRRPeter Bezdek, Nikola Benes, Vojtech Havel, Jiri Barnat

    The parameter synthesis problem for 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 proposed pro