This article addresses the problem of designing memory-efficient algorithms for the verification of temporal properties of finite-state programs. Both the programs and their desired temporal properties are modeled as automata on infinite words (Biichi automata). Verification is then reduced to check
Algorithms with memory for computation of properties
โ Scribed by A. I. Kondrat'ev
- Publisher
- Springer US
- Year
- 1988
- Tongue
- English
- Weight
- 706 KB
- Volume
- 24
- Category
- Article
- ISSN
- 1573-8337
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Algorithms are described for the calculation of spatial statistics. The statistics are the functions K(t), G(y), F(x), and K12(t). They can be used to determine (a) which type of spatial process ('random', ' clustered', 'regular', etc.) best fits a data set and whether the spatial pattern changes wi
Ray tracing is a well known technique to generate life-like images. Unfortunately, ray tracing complex scenes can require large amounts of CPU time and memory storage. Distributed memory parallel computers with large memory capacities and high processing speeds are ideal candidates to perform ray tr