Cart (Loading....) | Create Account
Close category search window

Symbolic Computation of Schedulability Regions Using Parametric Timed Automata

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

In this paper, we address the problem of symbolically computing the region in the parameter's space that guarantees a feasible schedule, given a set of real-time tasks characterised by a set of parameters and by an activation pattern. We make three main contributions. First, we propose a novel and general method, based on parametric timed automata. Second, we prove that the algorithm terminates for the case of periodic processes with bounded offsets. Third, we provide an implementation based on the use of symbolic model checking techniques for parametric timed automata, and present some case studies.

Published in:

Real-Time Systems Symposium, 2008

Date of Conference:

Nov. 30 2008-Dec. 3 2008

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.