Flexible support for time and costs in scenario-aware dataflow

Scenario-aware dataflow is a formalism to model modern dynamic embedded applications whose behaviour is heavily dependent on input data or the operational environment. Key behavioural aspects are the execution times and energy consumption of a system's components. In this paper, we introduce flexible scenario-aware dataflow : a proper generalisation of previous definitions that allows any execution time to be specified as discretely or continuously random or nondeterministic. Additionally, it supports the modelling of abstract costs like the energy usage of components. We give a formal compositional semantics in terms of networks of stochastic timed automata. We have implemented support for analysing performance properties of flexible scenario-aware dataflow graphs via simulation and model checking. A number of reduction techniques are applied to make the underlying state spaces tractable for model checking. We evaluate the scalability and performance of our new model and implementation on standard benchmarks.

[1]  Wolfgang Rosenstiel,et al.  Analysis of multi-domain scenarios for optimized dynamic power management strategies , 2012, 2012 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[2]  George J. Pappas,et al.  Optimal Paths in Weighted Timed Automata , 2001, HSCC.

[3]  Kim G. Larsen,et al.  Minimum-Cost Reachability for Priced Timed Automata , 2001, HSCC.

[4]  Edward A. Lee,et al.  Synchronous Data Flow: Describing Signal Processing Algorithm for Parallel Computation , 1987, COMPCON.

[5]  Holger Hermanns,et al.  Simulation and Statistical Model Checking for Modestly Nondeterministic Models , 2012, MMB/DFT.

[6]  Holger Hermanns,et al.  The Modest Toolset: An Integrated Environment for Quantitative Modelling and Verification , 2014, TACAS.

[7]  Sander Stuijk,et al.  A scenario-aware data flow model for combined long-run average and worst-case performance analysis , 2006, Fourth ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2006. MEMOCODE '06. Proceedings..

[8]  Gethin Norman,et al.  Model checking for probabilistic timed automata , 2012, Formal Methods in System Design.

[9]  Christel Baier,et al.  Model-Checking Algorithms for Continuous-Time Markov Chains , 2002, IEEE Trans. Software Eng..

[10]  Marc Geilen,et al.  Performance Model Checking Scenario-Aware Dataflow , 2011, FORMATS.

[11]  Lijun Zhang,et al.  Measurability and safety verification for stochastic hybrid systems , 2011, HSCC '11.

[12]  Kim G. Larsen,et al.  Reduction and Refinement Strategies for Probabilistic Analysis , 2002, PAPM-PROBMIV.

[13]  Sander Stuijk,et al.  SDF^3: SDF For Free , 2006, Sixth International Conference on Application of Concurrency to System Design (ACSD'06).

[14]  Joost-Pieter Katoen,et al.  Exponentially timed SADF: Compositional semantics, reductions, and analysis , 2014, 2014 International Conference on Embedded Software (EMSOFT).

[15]  Holger Hermanns,et al.  Electronic Communications of the EASST Volume 70 ( 2014 ) Proceedings of the 14 th International Workshop on Automated Verification of Critical Systems ( AVoCS 2014 ) Reachability and Reward Checking for Stochastic Timed Automata , 2014 .

[16]  Shuvra S. Bhattacharyya,et al.  Embedded Multiprocessors: Scheduling and Synchronization , 2000 .

[17]  Shuvra S. Bhattacharyya,et al.  Embedded Multiprocessors: Scheduling and Synchronization, Second Edition , 2009 .

[18]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[19]  Marta Z. Kwiatkowska,et al.  Symbolic model checking for probabilistic timed automata , 2007, Inf. Comput..