Results 1  10
of
12
Process algebra for synchronous communication
 Inform. and Control
, 1984
"... Within the context of an algebraic theory of processes, an equational specification of process cooperation is provided. Four cases are considered: free merge or interleaving, merging with communication, merging with mutual exclusion of tight regions, and synchronous process cooperation. The rewrite ..."
Abstract

Cited by 432 (65 self)
 Add to MetaCart
Within the context of an algebraic theory of processes, an equational specification of process cooperation is provided. Four cases are considered: free merge or interleaving, merging with communication, merging with mutual exclusion of tight regions, and synchronous process cooperation. The rewrite system behind the communication algebra is shown to be confluent and terminating (modulo its permutative reductions). Further, some relationships are shown to hold between the four concepts of merging. © 1984 Academic Press, Inc.
A brief history of process algebra
 Theor. Comput. Sci
, 2004
"... Abstract. This note addresses the history of process algebra as an area of research in concurrency theory, the theory of parallel and distributed systems in computer science. Origins are traced back to the early seventies of the twentieth century, and developments since that time are sketched. The a ..."
Abstract

Cited by 82 (1 self)
 Add to MetaCart
(Show Context)
Abstract. This note addresses the history of process algebra as an area of research in concurrency theory, the theory of parallel and distributed systems in computer science. Origins are traced back to the early seventies of the twentieth century, and developments since that time are sketched. The author gives his personal views on these matters. He also considers the present situation, and states some challenges for the future.
A Methodology for Hardware Verification Based on Logic Simulation
 Journal of the ACM
, 1991
"... A logic simulator can prove the correctness of a digital circuit if it can be shown that only circuits fulfilling the system specification will produce a particular response to a sequence of simulation commands. This style of verification has advantages over other proof methods in being readily a ..."
Abstract

Cited by 37 (4 self)
 Add to MetaCart
(Show Context)
A logic simulator can prove the correctness of a digital circuit if it can be shown that only circuits fulfilling the system specification will produce a particular response to a sequence of simulation commands. This style of verification has advantages over other proof methods in being readily automated and requiring less attention on the part of the user to the lowlevel details of the design. It has advantages over other approaches to simulation in providing more reliable results, often at a comparable cost.
Using ITL and Tempura for Large Scale Specification and Simulation
 IN PROC. 4TH EUROMICRO WORKSHOP ON PARALLEL AND DISTRIBUTED PROCESSING
, 1996
"... ITL and Tempura are used for respectively the formal specification and simulation of a large scale system, namely the general purpose multithreaded dataflow processor EP/3. This paper shows that this processor can be specified concisely within ITL and simulated with Tempura. But it also discusses s ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
ITL and Tempura are used for respectively the formal specification and simulation of a large scale system, namely the general purpose multithreaded dataflow processor EP/3. This paper shows that this processor can be specified concisely within ITL and simulated with Tempura. But it also discusses some problems encountered during the specification and simulation, and indicates what should be added to solve those problems.
Toward a Basis for Protocol Specification and Process Decomposition
 in Proceedings of the IFIP Conference on Hardware Description Languages and their Applications
, 1993
"... In a formalism of topdown design, we consider the decomposition of behavioral specifications into interacting sequential components. The higher level of description specifies the operations to be performed in a major computation step. The goal is to incorporate a given interface specification in a ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
In a formalism of topdown design, we consider the decomposition of behavioral specifications into interacting sequential components. The higher level of description specifies the operations to be performed in a major computation step. The goal is to incorporate a given interface specification in a lowerlevel specification that accounts for interactions with and among sequential components. This construction generalizes the earlier formalism of system factorization [14] to include interface protocols. It expands on the objectives of highlevel synthesis by considering controlsynchronization loops in scheduling. This paper presents a specification language for sequential process interaction and develops an interpretation based on finitestatemachines. Operations of minimization, composition and complementation are defined; the last of these being the key to topdown decomposition. A small example is used to illustrate the ideas. Keyword Codes: B.4.3; B.4.4; F.3.1 Keywords: Input/Outp...
Modelling a Subclass of CMOS Circuits using a Process Algebra
, 1999
"... In this paper we introduce a technique for modelling a subclass of CMOS circuits using the Circal process algebra. We first introduce the basic techniques for modelling hardware in an event based formalism, such as a process algebra: the levelbased and the transitionbased modelling techniques. The ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
In this paper we introduce a technique for modelling a subclass of CMOS circuits using the Circal process algebra. We first introduce the basic techniques for modelling hardware in an event based formalism, such as a process algebra: the levelbased and the transitionbased modelling techniques. Then we show how to model pMOS and nMOS transistors and how to connect them for modelling a subclass of CMOS circuits which are used in the design of asynchronous hardware.
unknown title
"... o verify is to prove the truth of something by presenting evidence for it. ” To benefit from this dictionarylike, generic definition, we must tailor it to the particular domain we want to consider: the design of hardware. Every design, no matter how strategic or complex, requires multifaceted verif ..."
Abstract
 Add to MetaCart
o verify is to prove the truth of something by presenting evidence for it. ” To benefit from this dictionarylike, generic definition, we must tailor it to the particular domain we want to consider: the design of hardware. Every design, no matter how strategic or complex, requires multifaceted verification before marketing. Starting from final manufacturing and moving back through previous phases of the process, we might find many objects for verification. LOWlevel design rules, timing, highlevel design rules, firmware, functional correctness, and base software might attract our