Results 1  10
of
37
Universal Computation and Other Capabilities of Hybrid and Continuous Dynamical Systems
, 1995
"... We explore the simulation and computational capabilities of hybrid and continuous dynamical systems. The continuous dynamical systems considered are ordinary differential equations (ODEs). For hybrid systems we concentrate on models that combine ODEs and discrete dynamics (e.g., finite automata). We ..."
Abstract

Cited by 72 (3 self)
 Add to MetaCart
We explore the simulation and computational capabilities of hybrid and continuous dynamical systems. The continuous dynamical systems considered are ordinary differential equations (ODEs). For hybrid systems we concentrate on models that combine ODEs and discrete dynamics (e.g., finite automata). We review and compare four such models from the literature. Notions of simulation of a discrete dynamical system by a continuous one are developed. We show that hybrid systems whose equations can describe a precise binary timing pulse (exact clock) can simulate arbitrary reversible discrete dynamical systems defined on closed subsets of R n . The simulations require continuous ODEs in R 2n with the exact clock as input. All four hybrid systems models studied here can implement exact clocks. We also prove that any discrete dynamical system in Z n can be simulated by continuous ODEs in R 2n+1 . We use this to show that smooth ODEs in R 3 can simulate arbitrary Turing machines, and henc...
Design and Implementation of a True Random Number Generator Based on
 Cryptographic Hardware and Embedded Systems  CHES 2003, Lecture Notes in Computer Science
, 2003
"... Abstract. There are many applications for true, unpredictable random numbers. For example the strength of numerous cryptographic operations is often dependent on a source of truly random numbers. Sources of random information are available in nature but are often hard to access in integrated circuit ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
(Show Context)
Abstract. There are many applications for true, unpredictable random numbers. For example the strength of numerous cryptographic operations is often dependent on a source of truly random numbers. Sources of random information are available in nature but are often hard to access in integrated circuits. In some specialized applications, analog noise sources are used in digital circuits at great cost in silicon area and power consumption. These analog circuits are often influenced by periodic signal sources that are in close proximity to the random number generator. We present a random number generator comprised entirely of digital circuits, which utilizes electronic noise. Unlike earlier work [11], only standard digital gates without regard to precise layout were used. 1
An Asynchronous Communication Mechanism Using SelfTimed Circuits
 Proc. Async2000, Eilat
, 1999
"... A modified 4slot asynchronous communication mechanism (ACM) using entirely selftimed circuits to implement the algorithm is presented here. Mutual exclusion elements are used to concentrate potential metastability to a couple of discrete points so that it can be resolved entirely within the mechani ..."
Abstract

Cited by 13 (11 self)
 Add to MetaCart
A modified 4slot asynchronous communication mechanism (ACM) using entirely selftimed circuits to implement the algorithm is presented here. Mutual exclusion elements are used to concentrate potential metastability to a couple of discrete points so that it can be resolved entirely within the mechanism itself, while the selftimed circuits allow the interface between the reader and writer processes and the mechanism to be minimised. Initial analyses show that this solution is more robust with regard to steering logic metastability, and can potentially run faster, than the original 4slot solution. 2 Introduction writer data in shared memory control variables reader Figure 1 Asynchronous data communication mechanisms using shared memory and control variables. Data communication between concurrent processes often employ shared memory which may have access conflicts when the processes are not synchronised. The most obvious way to protect shared memory is to put it into a critical section ...
PetriNet Based Investigation of SynchronisationFree Interprocess Communication in SharedMemory RealTime Systems
, 1997
"... This paper presents the results of the analysis of the synchronisationfree interprocesscommunications mechanisms using Petrinet based methods [3]. This provides an automated and more straightforward alternative verification of the validity of the previous analyses by Simpson, offers an easier fou ..."
Abstract

Cited by 10 (9 self)
 Add to MetaCart
This paper presents the results of the analysis of the synchronisationfree interprocesscommunications mechanisms using Petrinet based methods [3]. This provides an automated and more straightforward alternative verification of the validity of the previous analyses by Simpson, offers an easier foundation for the investigation of the more general cases, and extensions to investigate the effects of metastability on the mechanism. This paper is intended to be read in conjunction with [1] and [2] which provide more detailed background information on the mechanisms including discussion of their practical and theoretical significance. 2 Modelling of the mechanisms
Ternary Simulation: A Refinement of Binary Functions or an Abstraction of RealTime Behaviour?
 PROCEEDINGS OF THE 3RD WORKSHOP ON DESIGNING CORRECT CIRCUITS (DCC96
, 1996
"... We prove the equivalence between the ternary circuit model and a notion of intuitionistic stabilization bounds. The results are obtained as an application of the timing interpretation of intuitionistic propositional logic presented in [12]. We show that if one takes an intensional view of the ternar ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
We prove the equivalence between the ternary circuit model and a notion of intuitionistic stabilization bounds. The results are obtained as an application of the timing interpretation of intuitionistic propositional logic presented in [12]. We show that if one takes an intensional view of the ternary model then the delays that have been abstracted away can be completely recovered. Our intensional soundness and completeness theorems imply that the extracted delays are both correct and exact; thus we have developed a framework which unifies ternary simulation and functional timing analysis. Our focus is on the combinational behaviour of gatelevel circuits with feedback.
Computing Synchronizer Failure Probabilities
, 2007
"... SystemonChip designs often have a large number of timing domains. Communication between these domains requires synchronization, and the failure probabilities of these synchronizers must be characterized accurately to ensure the robustness of the complete system. We present a novel approach for d ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
SystemonChip designs often have a large number of timing domains. Communication between these domains requires synchronization, and the failure probabilities of these synchronizers must be characterized accurately to ensure the robustness of the complete system. We present a novel approach for determining the failure probabilities of synchronizer circuits. We use numerical intergration to perform largesignal analysis that accounts for the nonlinear behaviour of real synchronizer circuits. We complement this with smallsignal techniques to characterize behaviours near the metastable equilibrium. This combination overcomes the limitations of traditional techniques: the largesignal analysis accounts for the transfer of metastable behaviour between synchronizer stages; and the smallsignal techniques overcome the limitations of numerical accuracy inherent in pure simulation approaches. Our approach is fully automated, is suitable for integration into circuit simulation tools such as SPICE, and enables accurate characterization of extremely small failure probabilities.
Timing Analysis of Combinational Circuits in Intuitionistic Propositional Logic
 Formal Methods in System Design
, 1999
"... Classical logic has so far been the logic of choice in formal hardware verification. This paper proposes the application of intuitionistic logic to the timing analysis of digital circuits. The intuitionistic setting serves two purposes. The modeltheoretic properties are exploited to handle the s ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
(Show Context)
Classical logic has so far been the logic of choice in formal hardware verification. This paper proposes the application of intuitionistic logic to the timing analysis of digital circuits. The intuitionistic setting serves two purposes. The modeltheoretic properties are exploited to handle the secondorder nature of bounded delays in a purely propositional setting without need to introduce explicit time and temporal operators. The proof theoretic properties are exploited to extract quantitative timing information and to reintroduce explicit time in a convenient and systematic way. We present a natural Kripkestyle semantics for intuitionistic propositional logic, as a special case of a Kripke constraint model for Propositional Lax Logic [15], in which validity is validity up to stabilisation, and implication oe comes out as "boundedly gives rise to." We show that this semantics is equivalently characterised by a notion of realisability with stabilisation bounds as realisers...
A Unified Approach to the Study of Asynchronous Communication Mechanisms in Real Time Systems.
, 2000
"... This thesis presents a new application of analyzing Asynchronous Communication Mechanisms (ACMs) using Petri nets. This technique facilitates the testing of essential ACM operating properties: data coherence (concurrent reading and writing of data at the same location should not happen), data freshn ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
This thesis presents a new application of analyzing Asynchronous Communication Mechanisms (ACMs) using Petri nets. This technique facilitates the testing of essential ACM operating properties: data coherence (concurrent reading and writing of data at the same location should not happen), data freshness (not reading out of date data) and data sequencing (not reading data in a newoldnew order). The technique allows for analysis under metastable conditions which cannot be avoided in an asynchronous environment, but have usually been omitted in the analysis of published ACM algorithms. The modelling techniques are described, along with the analysis methods and optimizations which allow the ACM models to be as compact as possible without omitting necessary detail. The method allows for fast automated analysis of ACMs therefore allowing design changes in the algorithms to be quickly analyzed, without the need to perform long formal proofs. The use of a common analysis method allows compari...
Hardware Evolution: On the Nature of Artificially Evolved Electronic Circuits
 University of Sussex, UK
, 2001
"... of the work presented in this thesis has been previously published as listed below. Although some of these papers have coauthors, the work appearing in this thesis is entirely my own, with the exception of parts of chapter 3, which presents work jointly carried out by myself and Adrian Thompson. Th ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
(Show Context)
of the work presented in this thesis has been previously published as listed below. Although some of these papers have coauthors, the work appearing in this thesis is entirely my own, with the exception of parts of chapter 3, which presents work jointly carried out by myself and Adrian Thompson. The respective contributions to this work will be explicitly stated at the beginning of the chapter. List of Previous Publications Kuntz, P., Layzell, P., & Snyers, D. (1997). A Colony of Antlike Agents for Partitioning
A Counterflow Pipeline Experiment
 In Proc. International Symposium on Advanced Research in Asynchronous Circuits and Systems
, 1999
"... The counterflow pipeline architecture [12] consists of two interacting pipelines in which data items flow in opposite directions. Interactions occur between two items when they meet in a stage. We present the design decisions for, and test measurements from, an asynchronous chip that explores the ba ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
The counterflow pipeline architecture [12] consists of two interacting pipelines in which data items flow in opposite directions. Interactions occur between two items when they meet in a stage. We present the design decisions for, and test measurements from, an asynchronous chip that explores the basic ideas of such an architecture. We built the chip in order to confirm proper operation of the arbiters required to ensure that each and every item flowing in one direction interacts with each and every item flowing in the other direction.