Efficient data structure for fully symbolic verification of real-time software systems

32Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A new data-structure called RED(Region-Encoding Diagram) for the fully symbolic model-checking of real-time software systems is proposed. RED is a BDD-like data-structure for the encoding of regions [2]. Unlike DBM which records differences between pairs of clock readings, REDonly uses one auxiliary binary variable for each clock. Thus the number of variables used in REDis always linear to the number of clocks declared in the input system description. Experiment has been carried out to compare REDwith previous technologies. © Springer-Verlag Berlin Heidelberg 2000.

Cite

CITATION STYLE

APA

Wang, F. (2000). Efficient data structure for fully symbolic verification of real-time software systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1785 LNCS, pp. 157–171). Springer Verlag. https://doi.org/10.1007/3-540-46419-0_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free