Task automata: Schedulability, decidability and undecidability

DOI10.1016/j.ic.2007.01.009zbMath1121.68062MaRDI QIDQ2643078

Pavel Krcal, Paul Pettersson, Elena Fersman, Wang Yi

Publication date: 23 August 2007

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2007.01.009

zbMATH Keywords

timed automata; schedulability analysis; real time systems; modeling and verification

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68Q60: Specification and verification (program logics, model checking, etc.)

Related Items

MODELING AND ANALYSIS OF REAL-TIME SYSTEMS WITH MUTEX COMPONENTS, Parametric Schedulability Analysis of a Launcher Flight Control System under Reactivity Constraints*, Decomposition of timed automata for solving scheduling problems, Testing Concurrent Objects with Application-Specific Schedulers, A survey of timed automata for the development of real-time systems, Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets, Interrupt timed automata: verification and expressiveness, Integrating deployment architectures and resource consumption in timed object-oriented models, Computing periodic request functions to speed-up the analysis of non-cyclic task models, Graph-based models for real-time workload: a survey, Compositional schedulability analysis of real-time actor-based systems, PADS: an approach to modeling resource demand and supply for the formal analysis of hierarchical scheduling, A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs, Combinatorial abstraction refinement for feasibility analysis of static priorities, Controller synthesis for dynamic hierarchical real-time plants using timed automata, A study on shuffle, stopwatches and independently evolving clocks, Zone-based verification of timed automata: extrapolations, simulations and what next?, Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm, Parametric multisingular hybrid Petri nets: formal definitions and analysis techniques, Schedulability of asynchronous real-time concurrent objects, A process algebraic approach to the schedulability analysis and workload abstraction of hierarchical real-time systems, Validating Timed Models of Deployment Components with Parametric Concurrency

Uses Software

• TIMES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The algorithmic analysis of hybrid systems
• What's decidable about hybrid automata?
• A theory of timed automata
• Time-abstracted bisimulation: Implicit specifications and decidability
• Schedulability analysis of fixed-priority systems using timed automata
• Tools and Algorithms for the Construction and Analysis of Systems
• Lectures on Concurrency and Petri Nets