Pages that link to "Item:Q2368958"
From MaRDI portal
The following pages link to Schedulability analysis of fixed-priority systems using timed automata (Q2368958):
Displaying 17 items.
- Graph-based models for real-time workload: a survey (Q497995) (← links)
- A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs (Q779456) (← links)
- Formal verification of real-time systems with preemptive scheduling (Q844238) (← links)
- Combinatorial abstraction refinement for feasibility analysis of static priorities (Q892994) (← links)
- Schedulability analysis for linear transactions under fixed priority hybrid scheduling (Q943098) (← links)
- Investigating the usability of real-time scheduling theory with the Cheddar project (Q1033676) (← links)
- Schedulability analysis of timed regular tasks by under-approximation on WCET (Q1660771) (← links)
- A study on shuffle, stopwatches and independently evolving clocks (Q1938360) (← links)
- Schedulability analysis for controller area network (CAN) with FIFO queues priority queues and gateways (Q2251362) (← links)
- Task automata: Schedulability, decidability and undecidability (Q2643078) (← links)
- Analysis of scheduling behaviour using generic timed automata (Q2703749) (← links)
- Model Checking Real-Time Systems (Q3176387) (← links)
- On Scheduling Policies for Streams of Structured Jobs (Q3543294) (← links)
- MODELING AND ANALYSIS OF REAL-TIME SYSTEMS WITH MUTEX COMPONENTS (Q4902881) (← links)
- Static Optimal Scheduling for Synchronous Data Flow Graphs with Model Checking (Q5206962) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5308410) (← links)
- Improving the analysis of GPC in real-time calculus (Q6535915) (← links)
