Sciweavers

154 search results - page 13 / 31
» Comparison of Process Algebra Equivalences Using Formats
Sort
View
FSTTCS
2003
Springer
15 years 2 months ago
Reachability Analysis of Process Rewrite Systems
We define a new model called O-PRS that extends the Process Rewrite Systems formalism with a new associative operator, “ ”, that allows to model parallel composition while ke...
Ahmed Bouajjani, Tayssir Touili
62
Voted
ACSD
2004
IEEE
118views Hardware» more  ACSD 2004»
15 years 1 months ago
Verification and Implementation of Delay-Insensitive Processes in Restrictive Environments
Abstract. A delay-insensitive module communicates with its environment through wires of unbounded delay. To avoid transmission interference, the absorption of a signal transition m...
Hemangee K. Kapoor, Mark B. Josephs, Dennis P. Fur...
CONCUR
1990
Springer
15 years 1 months ago
A Temporal Calculus of Communicating Systems
In this paper we describe the calculus TCCS, an extension of the process algebra CCS with temporal constructs. The calculus is useful for the formal analysis of the timing aspects...
Faron Moller, Chris M. N. Tofts
TCS
2008
14 years 9 months ago
Using bisimulation proof techniques for the analysis of distributed abstract machines
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...
Damien Pous
AB
2008
Springer
15 years 4 months ago
On the Computational Power of Biochemistry
We explore the computational power of biochemistry with respect to basic chemistry, identifying complexation as the basic mechanism that distinguishes the former from the latter. W...
Luca Cardelli, Gianluigi Zavattaro