<?xml version="1.0" encoding='ISO-8859-1'?>
<!--DOCTYPE component PUBLIC "-//OCERA//DTD component XML V1.0//EN" "file:component.dtd"-->

<component id="versched" name="Verification of RTOS">
  <title>Verification of cooperative scheduling and interrupt
	  handlers</title>
  <info>
    <authorgroup>
      
      <author>
	<firstname>Libor</firstname>
	<surname>Waszniowski</surname>
	<affiliation>
	  <orgname>CTU</orgname>
	</affiliation>
	<email><ulink url="mailto:xwasznio@lab.felk.cut.cz">xwasznio@lab.felk.cut.cz</ulink></email>
      </author>

      <author>
	<firstname>Zdenek</firstname>
	<surname>Hanzalek</surname>
	<affiliation>
	  <orgname>CTU</orgname>
	</affiliation>
	<email><ulink url="mailto:hanzalek@rtime.felk.cvut.cz">hanzalek@rtime.felk.cvut.cz</ulink></email>
      </author>

    </authorgroup>
    
    <copyright>
      <year>2003</year>
      <holder>OCERA Consortium</holder>
    </copyright>

    <workpackage id="WP7" />

    <date start="01/07/2002" release="01/04/2003"/>

    <version value="0.1"/>
    <license value="GPL"/>
    <status value="Analysis"/>
    <home-page url="http://www.ocera.org"/>
    <hardware processor="Independent"/>
    <platform rtlinux="3.1"/>
    <componenttype value="LowLevel"/>
    <keywords>Real time, Operating system, Cooperative scheduling, Timed automata, Model checking</keywords>
    <reviewergroup>
      <author>
	<firstname></firstname>
	<surname></surname>
	<affiliation>
	  <orgname></orgname>
	</affiliation>
	<email><ulink url="mailto:"></ulink></email>
      </author>
    </reviewergroup>

  </info>


  <!-- ================================================== Description -->
  <description>
    This component is theoretical study
		offering methodology and tool support for model
		checking of real-time applications running under
		multitasking operating system. Theoretical background
		is based on timed automata by Allur and Dill.  As this
		approach does not allow to model pre-emption we focus
		on cooperative scheduling.  The cooperative scheduler
		under assumption performs rescheduling in specific
		points given by "yield" instruction in the application
		processes. In the addition, interrupt service routines
		are considered, and their enabling/disabling is
		controlled by interrupt server considering specified
		server capacity.  The server capacity has influence on
		the margins of the computation times in the
		application processes.  Such systems, used in
		practical real-time applications, can be modelled by
		timed automata and further verified by existing model
		checking tools. The approach is illustrated in the
		form of examples in the real-time verification tool
		UPPAAL.
  </description>  
</component>

