Automatic verification of asynchronous circuits using temporal logic
- 1 January 1986
- journal article
- Published by Institution of Engineering and Technology (IET) in IEE Proceedings E Computers and Digital Techniques
- Vol. 133 (5), 276-282
- https://doi.org/10.1049/ip-e.1986.0034
Abstract
A method is presented for automatically verifying asynchronous sequential circuits using temporal logic specifications. The method takes a circuit desctibed in terms of Boolean gates and Muller elements, and derves a state graph that summaries all possible circuit executions resulting from any set of finite delays on the outputs of the components. The correct behaviour of the circuit is expressed in CTL, a temporal logic. This specification is checked against the state graph using a model checker program. Using this method, a timing error in a published arbiter design is discovered. A corrected arbiter is given and verifiedKeywords
This publication has 4 references indexed in Scilit:
- Automatic verification of finite state concurrent system using temporal logic specificationsPublished by Association for Computing Machinery (ACM) ,1983
- Temporal logic can be more expressivePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- A Calculus of Communicating SystemsLecture Notes in Computer Science, 1980
- The general synthesis problem for asynchronous digital networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1967