Model-based Analysis of Distributed Real-time Embedded System Composition Gabor Madl [[email protected]] Sherif Abdelwahed [[email protected]] http://dre.sourceforge.net EMSOFT 2005

Download Report

Transcript Model-based Analysis of Distributed Real-time Embedded System Composition Gabor Madl [[email protected]] Sherif Abdelwahed [[email protected]] http://dre.sourceforge.net EMSOFT 2005

Model-based Analysis of Distributed Real-time
Embedded System Composition
Gabor Madl [[email protected]]
Sherif Abdelwahed [[email protected]]
http://dre.sourceforge.net
EMSOFT 2005
Motivation
Approach
DRE SEMANTIC DOMAIN
Decidability
Case study
Conclusion
Motivation
 Define a library of semantically well-defined elements to analyze and
optimize distributed real-time embedded (DRE) systems
 Define a framework for component-based design that allows a higher degree
of reusability
 Provide a method to map functional requirements to the target platform to
allow platform-based design on a formal basis
 Integrate the framework with existing analysis tools to provide a way for the
automatic verification and rapid evaluation of system designs
http://dre.sourceforge.net
EMSOFT 2005
Motivation
Approach
DRE SEMANTIC DOMAIN
Decidability
Case study
Conclusion
Model Checking
Design
feedback
Design
feedback
Domain Specific Model
Semantic
Analysis
Domain
mapping
Analysis
Model
Generator
Input
Model
Checker
Property Verification
http://dre.sourceforge.net
Simulator
Executable
Code
Trace Verification
EMSOFT 2005
Motivation
Approach
DRE SEMANTIC DOMAIN
Decidability
DRE SEMANTIC DOMAIN
http://dre.sourceforge.net
EMSOFT 2005
Case study
Conclusion
Motivation
Approach
DRE SEMANTIC DOMAIN
Decidability
Case study
Conclusion
Decidability
 The proposed model of computation corresponds to the stopwatch model
 Checking the preemptive schedulability using timed automata has been
shown to be undecidable*
 We present a novel conservative approximation method:
» (t  T) D(t)  Period(t) –
» If the system is schedulable in discrete time  it is schedulable in continuous time
as well
WCET (t ' )
t 'Frame ( t ) t
*Pavel Krčál, Wang Yi: Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata, Proceedings of TACAS 2004, pp. 236-250
http://dre.sourceforge.net
EMSOFT 2005
Motivation
Approach
DRE SEMANTIC DOMAIN
Decidability
Preemptive avionics example (1/2)
http://dre.sourceforge.net
EMSOFT 2005
Case study
Conclusion
Motivation
Approach
DRE SEMANTIC DOMAIN
Decidability
Preemptive avionics example (2/2)
http://dre.sourceforge.net
EMSOFT 2005
Case study
Conclusion
Motivation
Approach
DRE SEMANTIC DOMAIN
Decidability
Case study
Conclusion
Conclusion
 We presented the generic DRE SEMANTIC DOMAIN which
captures the reactive behavior of DRE systems
 We presented a method to verify the composition of real-time embedded
systems on distributed preemptive platforms
 The method captures delays, asynchrony, event buffering and asynchronous
communication
 Model-based technologies help bridging the gap between declarative
specifications and imperative implementations
 Visit http://dre.sourceforge.net for downloads, examples and more details.
http://dre.sourceforge.net
EMSOFT 2005
Questions?
http://dre.sourceforge.net
EMSOFT 2005