IJPE 2017
DOI: 10.23940/ijpe.17.06.p1.785795
|View full text |Cite
|
Sign up to set email alerts
|

Schedulability Analysis and Symbolic Verification Method for Heterogeneous Multicore Real-Time Systems

Abstract: As heterogeneous multicore real-time systems are increasingly applied in safety critical systems, it is important to ensure the correctness of these systems. One key attribute of real-time systems is the schedulability that guarantees to satisfy the timing requirements. This paper presents a method for modeling and verifying schedulability of heterogeneous multi-core systems and the method we present uses timedautomata (TA) to model tasks and resources of heterogeneous systems considering their special feature… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 9 publications
(6 reference statements)
0
2
0
Order By: Relevance
“…Hardware heterogeneity was considered in Wanget et al [197]. They presented a schedulability analysis based on Timed Automata and the symbolic verification method for heterogeneous multicore real-time systems.…”
Section: Schedulability Analysis Techniquesmentioning
confidence: 99%
“…Hardware heterogeneity was considered in Wanget et al [197]. They presented a schedulability analysis based on Timed Automata and the symbolic verification method for heterogeneous multicore real-time systems.…”
Section: Schedulability Analysis Techniquesmentioning
confidence: 99%
“…For this reason, many studies of simulation-based schedulability analysis have considered various formal modeling languages [15]- [24]. Especially, timed automata (TA) have been used widely to specify system models [20], [24]- [29]. Krcal et al [25] propose schedulability analysis using task automata (TA extended with tasks), and focus on partitioned scheduling (i.e., Each task runs on a fixed processor and cannot be migrated to another processor).…”
Section: Related Workmentioning
confidence: 99%