Title :
Region Encoding Diagram for fully symbolic verification of real-time systems
Author_Institution :
Inst. of Inf. Sci., Acad. Sinica, Taipei, Taiwan
Abstract :
RED (Region Encoding Diagram), first reported by F.Wang (2000), is a BDD-like data structure for fully symbolic verification of symmetric real time systems with single clock per process. We propose to extend RED for asymmetric real time systems with an unrestricted number of global or local clocks. Unlike in DBM which records differences between pairs of clock readings, we record the ordering among fractional parts of clock readings into integer sequences encoded in RED´s. Like BDD, the new RED is also a minimal canonical form for its target system state-space representations. The number of variables used in RED is O(|X|log|X|) where X is the clock set in the input system description. Experimentation has been carried out to compare RED´s performance with the tools: UPPAAL2K and Kronos. Accordingly, we found out that RED is the most efficient real time system safety analyzer as long as concurrency complexity is considered
Keywords :
binary decision diagrams; clocks; computational complexity; data structures; program verification; real-time systems; BDD-like data structure; Kronos; RED; Region Encoding Diagram; UPPAAL2K; asymmetric real time systems; clock readings; clock set; concurrency complexity; fractional parts; fully symbolic verification; input system description; integer sequences; local clocks; minimal canonical form; real time system safety analyzer; symmetric real time systems verification; target system state-space representations; Binary decision diagrams; Boolean functions; Clocks; Concurrent computing; Data structures; Encoding; Information science; Real time systems; Safety; Space technology;
Conference_Titel :
Computer Software and Applications Conference, 2000. COMPSAC 2000. The 24th Annual International
Conference_Location :
Taipei
Print_ISBN :
0-7695-0792-1
DOI :
10.1109/CMPSAC.2000.884774