CIRCAL and the representation of communication, concurrency, and time
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Communicating sequential processes
Communications of the ACM
Formal Specification and Verification in VLSI Design
Formal Specification and Verification in VLSI Design
Communication and Concurrency
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Deciding Properties of Timed Transition Models
IEEE Transactions on Parallel and Distributed Systems
Timing Verification and the Timing Analysis program
DAC '82 Proceedings of the 19th Design Automation Conference
Specifying Transaction-Based Information Systems with Regular Expressions
IEEE Transactions on Software Engineering
Proving testing preorders for process algebra descriptions
EDTC '95 Proceedings of the 1995 European conference on Design and Test
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 14.98 |
A formalism in which timing properties of digital hardware may be specified, derived, and formally verified is introduced as a rigorous theory for hardware timing. A rigorous modeling framework has been used to create a family of related verification techniques rather than a single timing analysis tool. This framework is based on a model of interacting finite state machines called CIRCAL, a formalism developed for the purpose of describing and validating complex concurrent systems. In this approach to hardware timing analysis, the presence of a composition operator is all-pervasive. It provides a single, uniform mechanism for describing the behavior of interacting hardware modules and for establishing and describing the timing properties of such modules.