Task automata: Schedulability, decidability and undecidability

DOI10.1016/J.IC.2007.01.009MaRDI QIDQ2643078zbMATH OpenOpenAlexFDO

Authors Elena Fersman, Pavel Krčál, Paul Pettersson, 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

modeling and verificationreal time systemsschedulability analysistimed automata

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Tools and Algorithms for the Construction and Analysis of Systems
• scientific article; zbMATH DE number 2080041
• Decomposition of timed automata for solving scheduling problems
• Undecidable Problems About Timed Automata
• Formal Methods for the Design of Real-Time Systems
• Lectures on Concurrency and Petri Nets
• Classes of timed automata and the undecidability of universality
• Classes of timed automata and the undecidability of universality
• Scheduling with timed automata
• scientific article; zbMATH DE number 1444359

Cites work

• A theory of timed automata
• Guided synthesis of control programs using UPPAAL
• scientific article; zbMATH DE number 1670789 (Why is no real title available?)
• scientific article; zbMATH DE number 1696502 (Why is no real title available?)
• scientific article; zbMATH DE number 1106353 (Why is no real title available?)
• scientific article; zbMATH DE number 2080041 (Why is no real title available?)
• scientific article; zbMATH DE number 2080067 (Why is no real title available?)
• scientific article; zbMATH DE number 1759410 (Why is no real title available?)
• scientific article; zbMATH DE number 1796155 (Why is no real title available?)
• Lectures on Concurrency and Petri Nets
• Schedulability analysis of fixed-priority systems using timed automata
• The algorithmic analysis of hybrid systems
• Time-abstracted bisimulation: Implicit specifications and decidability
• Tools and Algorithms for the Construction and Analysis of Systems
• What's decidable about hybrid automata?

Cited in

(33)

• Scheduling hard sporadic tasks with regular languages and generating functions.
• Controller synthesis for dynamic hierarchical real-time plants using timed automata
• A study on shuffle, stopwatches and independently evolving clocks
• Quasi-static scheduling of communicating tasks
• 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
• Quasi-Static Scheduling of Communicating Tasks
• A survey of timed automata for the development of real-time systems
• scientific article; zbMATH DE number 1163641 (Why is no real title available?)
• scientific article; zbMATH DE number 1949648 (Why is no real title available?)
• scientific article; zbMATH DE number 1956583 (Why is no real title available?)
• Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets
• scientific article; zbMATH DE number 2080041 (Why is no real title available?)
• Interrupt timed automata: verification and expressiveness
• scientific article; zbMATH DE number 2147037 (Why is no real title available?)
• Integrating deployment architectures and resource consumption in timed object-oriented models
• Modeling and analysis of real-time systems with mutex components
• Computing periodic request functions to speed-up the analysis of non-cyclic task models
• Graph-based models for real-time workload: a survey
• Parametric schedulability analysis of a launcher flight control system under reactivity constraints
• Decomposition of timed automata for solving scheduling problems
• Compositional schedulability analysis of real-time actor-based systems
• Tools and Algorithms for the Construction and Analysis of Systems
• Testing Concurrent Objects with Application-Specific Schedulers
• Cycle encoding-based parameter synthesis for timed automata safety
• Reachability for updatable timed automata made faster and more effective
• 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

Describes a project that uses

Uses Software

• TIMES

This page was built for publication: Task automata: Schedulability, decidability and undecidability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643078)