Task automata: Schedulability, decidability and undecidability

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

Paul Pettersson, Wang Yi, Elena Fersman, Pavel Krcal

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, 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, PADS: an approach to modeling resource demand and supply for the formal analysis of hierarchical scheduling, Combinatorial abstraction refinement for feasibility analysis of static priorities, A study on shuffle, stopwatches and independently evolving clocks, 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, Validating Timed Models of Deployment Components with Parametric Concurrency

Uses Software

• TIMES

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item