Analyzing partially-implemented real-time systems

Analyzing partially-implemented real-time systems

We propose a method for analyzing partially-implemented real-time systems. Here we consider real-time concurrent systems for which some components are implemented in Ada and some are partially specified using regular expressions and Graphical Interval Logic (GIL), a real-time temporal logic. We show...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Avrunin, George S., Corbett, James C., Dillon, Laura K.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Computer science
Computer systems organization > Dependable and fault-tolerant systems and networks
Computer systems organization > Embedded and cyber-physical systems
Computer systems organization > Embedded and cyber-physical systems > Embedded systems
Computer systems organization > Real-time systems
Concurrent computing
Electronic equipment testing
Error correction
General and reference > Cross-computing tools and techniques > Performance
Logic
Networks > Network performance evaluation
Permission
Real time systems
Software and its engineering > Software notations and tools > General programming languages > Language types
Software and its engineering > Software organization and properties > Software system structures > Embedded software
Software and its engineering > Software organization and properties > Software system structures > Real-time systems software
Statistical analysis
System testing
Theory of computation > Logic
Timing
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We propose a method for analyzing partially-implemented real-time systems. Here we consider real-time concurrent systems for which some components are implemented in Ada and some are partially specified using regular expressions and Graphical Interval Logic (GIL), a real-time temporal logic. We show how to construct models of the partially-implemented systems that account for such properties as run-time overhead and scheduling of processes, yet support tractable analysis of nontrivial programs. The approach can be fully automated, and we illustrate it by analyzing a small example.
ISSN:0270-5257
1558-1225
DOI:10.1145/253228.253275