Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
708 IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, VOL.20. NO. 9, SEPTEMBER 1994 Automated Derivation of Time Bounds
 

Summary: 708 IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, VOL.20. NO. 9, SEPTEMBER 1994
Automated Derivation of Time Bounds
in Uniprocessor Concurrent Systerns
George S. Avrunin, James C. Corbett, Laura K. Dillon, Member, IEEE, and Jack C. Wileden, Senior Member, IEEE
Abstruct- The successful development of complex real-time
systemsdepends on analysistechniquesthat can accuratelyassess
the timing properties of those systems. This paper describes a
technique for deriving upper and lower bounds on the time
that can elapse between two given events in an execution of a
concurrent software system running on a single processor under
arbitrary scheduling. The technique involves generating linear
inequalities expressing conditions that must be satisfied by all
executions of such a system and using integer programming
methods to find appropriate solutions to the inequalities. The
technique does not require construction of the state space of
the system and its feasibility has been demonstratedby using an
extended version of the constrainedexpressiontoolset to analyze
the timing properties of some concurrent systemswith very large
state spaces.
Index Terms- Concurrent systems, real-time systems, auto-

  

Source: Avrunin, George S. - Department of Mathematics and Statistics, University of Massachusetts at Amherst

 

Collections: Mathematics