A theory for nondeterminism, parallelism, communication, and concurrency
Theoretical Computer Science
Testing delay-insensitive circuits
Proceedings of the 1991 University of California/Santa Cruz conference on Advanced research in VLSI
Alpha architecture reference manual
Alpha architecture reference manual
Four State Asynchronous Architectures
IEEE Transactions on Computers
An Efficient Implementation of Boolean Functions as Self-Timed Circuits
IEEE Transactions on Computers
Formal hardware verification methods: a survey
Formal Methods in System Design - Special issue on computer-aided verification: general methods
Representing and modeling digital circuits
Representing and modeling digital circuits
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Journal of Electronic Testing: Theory and Applications
Designing Self-Timed Devices Using the Finite Automaton Model
IEEE Design & Test
Hazards, Critical Races, and Metastability
IEEE Transactions on Computers
Testing self-timed circuits using partial scan
ASYNC '95 Proceedings of the 2nd Working Conference on Asynchronous Design Methodologies
Towards Asynchronous A-D Conversion
ASYNC '98 Proceedings of the 4th International Symposium on Advanced Research in Asynchronous Circuits and Systems
Trace theory for automatic hierarchical verification of speed-independent circuits
Trace theory for automatic hierarchical verification of speed-independent circuits
A formal approach to designing delay-insensitive circuits
Distributed Computing
Sequential Machines: Selected Papers
Sequential Machines: Selected Papers
| Hi-index | 0.00 |
In this paper a formal model for asynchronous systems behaviour is presented which is suited for representing all levels of abstraction appearing in the design process. Based on a structural abstraction of asynchronous computation systems called asynchronous nets the behaviour of an asynchronous system can be represented by a set of so called abstract computations. It is shown how basic properties of such systems, and in particular, delay-insensitive behaviour, could be determined by investigating properties of abstract computations. Finally, it is demonstrated that the model enables formal verification of asynchronous systems over different levels of abstraction.