Abstract

An enumerative technique is presented which supports reachability and timeliness analysis of time-dependent models based. The technique assumes a dense model of time and uses equivalence classes to enable discrete and compact enumeration of the state space. Properties of timed reachability among states are recovered through the analysis of timing constraints embedded within equivalence classes. In particular, algorithms are given to evaluate a tight profile for the set of feasible timings of any untimed run. Run time refinement of static profiles supports a mixed static/dynamic strategy in the development of a failure avoidance mechanism for dynamic acceptance and guarantee of hard real time processes.

Citations

2571	Scheduling algorithms for multiprogramming in a hard-real-time environment - Liu, Layland - 1973
1195	Petri Nets: Properties, Analysis and Applications - Murata - 1989
743	Priority Inheritance Protocol: An Approach to Realtime Synchronization - Sha, Rajkumar, et al. - 1987
446	Network Flows - Magnanti, Orlin - 1993
371	Automata for modeling real-time systems - Alur, Dill - 1990
339	D.: Model-checking for real-time systems - Alur, Courcourbetis, et al. - 1990
181	The Spring Kernel: a new paradigm for real-time operating systems - STANKOVIC, RAMAMRITHAM - 1989
145	Scheduling processes with release times, deadlines, precedence and exclusion relations - Xu, Parnas
120	Distributed Scheduling of Tasks with Deadlines and Resource Requirements - Ramamritham, Stankovic, et al. - 1989
101	Scheduling algorithms and operating system support for real-time systems - RAMAMRITHAM, STANKOVIC - 1994
95	Generalized rate-monotonic scheduling theory: A framework for developing real-time systems - SHA, RAJKUMAR, et al. - 1994
78	Recoverability of Communication Protocols - Merlin, Farber - 1976
75	Scheduling tasks with resource requirements in Hard Real-time Systems - Zhao, Ramamrithan, et al. - 1987
63	Timing Constraints of Real-Time Systems: Constructs for Expressing Them, Method of Validating Them - Dasarathy - 1985
63	On satifying timing constraints in hardreal-time systems - Xu, Parnas - 1991
59	Safety analysis using Petri nets - Leveson, Stolzy - 1987
54	Allocation and Scheduling of Precedence-Related Periodic Tasks - Ramamritham - 1995
51	An enumerative approach for analyzing time Petri nets - Berthomieu, Menasche - 1983
51	Scheduling a Steel Plant with Timed Automata - Fehnker - 1999
35	Timing analysis of Ada tasking programs - Corbett - 1996
33	Assignment Scheduling Communication periodic Tasks in Distributed Real Time System - Peng, Shin, et al. - 1997
28	Real-Time Concurrent C: A Language for Programming Dynamic - Gehani, Ramamritham - 1991
27	Liu,ªBounding Completion Times of Jobs with Arbitrary Release Times and Variable Execution Times,º - Sun, S - 1996
26	L.: Modular State Space Analysis of Coloured Petri nets - Christensen, Petrucci - 1995
24	Compositional Validation of Time-Critical Systems Using Communicating Time Petri Nets - Bucci, Vicario - 1995
16	Automatic Symbolic Veri of Embedded Systems - Alur, Henzinger, et al. - 1996
15	Timed automata as task models for eventdriven systems - Norström, Wall, et al. - 1999
13	Modeling and veri of time dependent systems using time Petri nets - Berthomieu, Diaz - 1991
13	Automatic Veri of Finite-state Concurrent Systems Using Temporal Logic Speci - Clarke, Emerson, et al. - 1986
9	Kernel-Level Threads for Dynamic, Hard Real-Time Environment - Humphrey, Wallace, et al. - 1995
9	Hierarchical reachability graph of bounded petri nets for concurrent-software analysis - Notomi, Murata - 1994
7	Tripakis and S.Yovine. The tool Kronos - Daws - 1996
7	Timing Assumptions and Veri of Finite-State Concurrent Systems - Dill - 1989
5	Compiling Real-Time Speci into Extended Automata - Nicollin, Sifakis, et al. - 1992
4	A Real-Time Library for the Design of Hybrid Robot Control Architectures - Beccari, Caselli, et al. - 1998
4	Deciding properties of Timed Transition Models - Ostro - 1990
3	Timing Analysis for Fixed Priority Scheduling of Hard Real Time Systems - Harbour, Lehoczky - 1994
2	F.Larsson, P.Pettersson, W.Yi, \UPPAAL: a Tool-Suite for Automatic Veri of Real-Time Systems - Bengtsson - 1996
2	About Real Time Computing - Stankovic - 1988
1	M.Di Natale, G.Buttazzo, \Implications of Classical Scheduling Results for Real-Time Systems - Stankovic - 1995
1	P.Tzounakis, \Veri with Real-Time COSPAN - Corcoubetis, Chatzaki - 1992
1	Minimum and Maximum Delay Problems - Corcoubetis - 1991
1	Quantitative Temporal Reasoning," Workshop on Automatic Veri Methods for Finite State Systems - Emerson, Sistla - 1989
1	Y.Atif,\Dynamic Scheduling of Real Time tasks, by Sssignment - Hamidzadeh - 1998
1	Speci of Parallel/Distributed Software and Systems by Petri Nets with Transition Enabling Functions - Papelis - 1992
1	What is Predictability for Real Time Systems - Stankovic