Compositional schedulability analysis of real-time actor-based systems

被引:0
作者
Mohammad Mahdi Jaghoori
Frank de Boer
Delphine Longuet
Tom Chothia
Marjan Sirjani
机构
[1] AMC,School of Computer Science
[2] CWI,undefined
[3] Leiden University,undefined
[4] University Paris-Sud,undefined
[5] LRI UMR8623,undefined
[6] University of Birmingham,undefined
[7] Reykjavík University,undefined
[8] University of Tehran and IPM,undefined
来源
Acta Informatica | 2017年 / 54卷
关键词
Model Check; Generate Test Case; Schedulability Analysis; First Come First Serve; State Space Explosion;
D O I
暂无
中图分类号
学科分类号
摘要
We present an extension of the actor model with real-time, including deadlines associated with messages, and explicit application-level scheduling policies, e.g.,“earliest deadline first” which can be associated with individual actors. Schedulability analysis in this setting amounts to checking whether, given a scheduling policy for each actor, every task is processed within its designated deadline. To check schedulability, we introduce a compositional automata-theoretic approach, based on maximal use of model checking combined with testing. Behavioral interfaces define what an actor expects from the environment, and the deadlines for messages given these assumptions. We use model checking to verify that actors match their behavioral interfaces. We extend timed automata refinement with the notion of deadlines and use it to define compatibility of actor environments with the behavioral interfaces. Model checking of compatibility is computationally hard, so we propose a special testing process. We show that the analyses are decidable and automate the process using the Uppaal model checker.
引用
收藏
页码:343 / 378
页数:35
相关论文
共 55 条
  • [1] Agha G(1997)A foundation for actor computation J. Funct. Program. 7 1-72
  • [2] Mason I(2002)Scheduler modeling based on the controller synthesis paradigm Real-Time Syst. 23 55-84
  • [3] Smith S(1994)A theory of timed automata Theoret. Comp. Sci. 126 183-235
  • [4] Talcott C(2010)Erlang Commun. ACM 53 68-75
  • [5] Altisen K(1998)Characterization of the expressive power of silent transitions in timed automata Fundam. Inf. 36 145-182
  • [6] Gößler G(2005)A refinement-based process algebra for timed automata Formal Asp. Comput. 17 138-159
  • [7] Sifakis J(1992)Minimum and maximum delay problems in real-time systems Form. Methods Syst. Des. 1 385-415
  • [8] Alur R(2007)Task automata: schedulability, decidability and undecidability Inf. Comput. 205 1149-1172
  • [9] Dill DL(2009)Scala actors: unifying thread-based and event-based programming Theor. Comput. Sci. 410 202-220
  • [10] Armstrong J(1994)Symbolic model checking for real-time systems Inf. Comput. 111 193-244