Formal Verification of OSEK/VDX Based Applications
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F04%3A03102811" target="_blank" >RIV/68407700:21230/04:03102811 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Formal Verification of OSEK/VDX Based Applications
Original language description
This article shows, how a preemptive multitasking application running under a real-time operating system compliant with OSEK/VDX standard can be modeled by timed automata. The application under consideration consists of several tasks, it includes synchronization by events and resource sharing. For such system, model-checking theory based on timed automata and implemented in model-checking tools can be used to verify time and logical properties of the proposed model. It is shown that the proposed model is over-approximation in the case of preemptive scheduling policy.
Czech name
Není k dispozici
Czech description
Není k dispozici
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1ET400750406" target="_blank" >1ET400750406: Participation in the evolution of the standardization for embedded software for automotive industry</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2004
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
RTSS 2004 Work-In-Progress Proceedings
ISBN
—
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
60-64
Publisher name
University of Lisbon
Place of publication
Lisboa
Event location
Lisabon
Event date
Dec 5, 2004
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—