Suspension automata: A decidable class of hybrid automata

McManis, Jennifer; Varaiya, Pravin

doi:10.1007/3-540-58179-0_47

Cited by 41 publications

(32 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Thus, we can easily model preemption. The difference with stopwatch automata [32,26,11] is that our clocks take discrete and not continuous values. As a consequence, reachability is decidable for discrete-time stopwatch automata, while it is not in general for continuous-time [26,19].…”

Section: System Modellingmentioning

confidence: 99%

A model-based approach for multiple QoS in scheduling: from models to implementation

Kloukinas

Yovine

2010

Autom Softw Eng

View full text Add to dashboard Cite

This is the unspecified version of the paper.This version of the publication may differ from the final published version. Abstract Meeting multiple Quality of Service (QoS) requirements is now an important factor for the success of complex software systems. This paper presents a correct-byconstruction, automated, model-driven scheduler synthesis approach for scheduling system tasks so as to meet multiple QoS requirements. As a first step, it shows how software engineers can meet deadlock-freedom and timeliness requirements, in a manner that (i) does not over-provision resources, (ii) does not require architectural changes to the system, and that (iii) leaves enough degrees of freedom to pursue further properties. The synthesis methodology directly associates each scheduler with a specific pair of QoS property and underlying platform execution model, so as to facilitate their validation and the understanding of the overall system behaviour, required to meet further QoS properties. The paper shows how the methodology is applied in practice and also presents the implementation infrastructure needed for executing an application on top of common operating systems, without requiring modifications of the operating system. Permanent repository link

show abstract

Section: System Modellingmentioning

confidence: 99%

A model-based approach for multiple QoS in scheduling: from models to implementation

Kloukinas

Yovine

2010

Autom Softw Eng

View full text Add to dashboard Cite

show abstract

“…In (McManis and Varaiya 1994), McManis and Varaiya propose an extension of timed automata, called suspension automata, where continuous variables progress similarly as exposed in (Cassez and Larsen 2000). They prove that, for this model, reachability is undecidable and fall back to a decidable case, similar to that of timed automata, by considering that the suspension durations are fixed and integral.…”

Section: Formal Models For Online Schedulingmentioning

confidence: 99%

Formal verification of real-time systems with preemptive scheduling

Lime¹,

Roux²

2008

Real-Time Syst

View full text Add to dashboard Cite

Abstract. In this paper, we propose a method for the verification of timed properties for real-time systems featuring a preemptive scheduling policy: the system, modeled as a scheduling time Petri net, is first translated into a linear hybrid automaton to which it is time-bisimilar. Timed properties can then be verified using HyTech. The efficiency of this approach leans on two major points: first, the translation features a minimization of the number of variables (clocks) of the resulting automaton, which is a critical parameter for the efficiency of the ensuing verification. Second, the translation is performed by an over-approximating algorithm, which is based on Difference Bound Matrix and therefore efficient, that nonetheless produces a time-bisimilar automaton despite the over-approximation. The proposed modeling and verification method are generic enough to account for many scheduling policies. In this paper, we specifically show how to deal with Fixed Priority and Earliest Deadline First policies, with the possibility of using Round-Robin for tasks with the same priority. We have implemented the method and give some experimental results illustrating its efficiency.

show abstract

“…Current approaches for stopwatch automata verification include semidecidable methods for reachability analysis using hybrid automata [22,23]. Potential directions to offer decidable results include using timed automata for the conservative approximation of the scheduling problem based on time discretization.…”

Section: Analysis For Preemptive Schedulingmentioning

confidence: 99%

“…A generic form to analyze scheduling behavior based on the timed automata model was proposed in [4] for single processor scheduling using the Immediate Ceiling Priority protocol and the EDF algorithm. Other methods propose the use of the stopwatch model to verify preemptive scheduling of real-time systems [22,23]. Contrary to earlier works, the Dream framework focuses on component-based DRE systems.…”

Section: Related Workmentioning

confidence: 99%

Verifying distributed real-time properties of embedded systems via graph transformations and model checking

2006

View full text Add to dashboard Cite

Component middleware provides dependable and efficient platforms that support key functional, and quality of service (QoS) needs of distributed real-time embedded (DRE) systems. Component middleware, however, also introduces challenges for DRE system developers, such as evaluating the predictability of DRE system behavior, and choosing the right design alternatives before committing to a specific platform or platform configuration. Model-based technologies help address these issues by enabling design-time analysis, and providing the means to automate the development, deployment, configuration, and integration of component-based DRE systems. To this end, this paper applies model checking techniques to DRE design models using model transformations to verify key QoS properties of component-based DRE systems developed using Real-time CORBA. We introduce a formal semantic domain for a general class of DRE systems that enables the verification of distributed non-preemptive real-time scheduling. Our results show that model-based techniques enable design-time analysis of timed properties and can be applied to effectively predict, simulate, and verify the event-driven behavior of component-based DRE systems.

show abstract

Suspension automata: A decidable class of hybrid automata

Cited by 41 publications

References 5 publications

A model-based approach for multiple QoS in scheduling: from models to implementation

A model-based approach for multiple QoS in scheduling: from models to implementation

Formal verification of real-time systems with preemptive scheduling

Verifying distributed real-time properties of embedded systems via graph transformations and model checking

Contact Info

Product

Resources

About