Paper Info
Title
Statistical model checking for networks of priced timed automata
Abstract
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 time- and cost-bounded properties. A second contribution of the paper is the application of Statistical Model Checking (SMC) to efficiently estimate the correctness of nonnested 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.
Year
DOI
Venue
2011
10.1007/978-3-642-24310-3_7
FORMATS
Keywords
Field
DocType
nonnested pwctl model checking,probabilistic weighted ctl property,statistical model checking,automata expressible,priced timed automata,classical satisfaction,natural stochastic semantics,case study,performance property,classical smc algorithm
Discrete mathematics,Model checking,Computer science,Automaton,Correctness,Algorithm,Statistical model checking,Theoretical computer science,Parametric statistics,Probabilistic logic,Partial order reduction,Semantics
Conference
Volume
ISSN
Citations 
6919
0302-9743
68
PageRank 
References 
Authors
1.94
20
7
Name
Order
Citations
PageRank
Alexandre David1166776.52
Kim G. Larsen23922254.03
Axel Legay32982181.47
Marius Mikučionis479933.52
Danny Bøgsted Poulsen530813.03
Jonas Van Vliet6712.35
Zheng Wang743192.42