Task automata: Schedulability, decidability and undecidability-Reference-Cited by-同舟云学术

Task automata: Schedulability, decidability and undecidability

Author:

Fersman Elena,Krcal Pavel,Pettersson Paul,Yi Wang

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference21 articles.

1. Hard Real-Time Computing Systems. Predictable Scheduling Algorithms and Applications;Buttazzo,1997

2. Timed automata as task models for event-driven systems;Ericsson,1999

3. Suspension automata: a decidable class of hybrid automata;McManis,1994

4. Compositional and symbolic model-checking of real-time systems;Larsen,1995

5. A theory of timed automata;Alur;Theoretical Computer Science,1994

Cited by 101 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

2. Answerable and Unanswerable Questions in Decision and Risk Analysis;International Series in Operations Research & Management Science;2023

3. The Generalized Graph Real-Time Task Model;2022 IEEE 20th International Conference on Embedded and Ubiquitous Computing (EUC);2022-12

5. WeaklyHard.jl: Scalable Analysis of Weakly-Hard Constraints;2022 IEEE 28th Real-Time and Embedded Technology and Applications Symposium (RTAS);2022-05