Results 1 
3 of
3
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 364 (51 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.
Using Metrics for Proof Rules for Recursively Defined Delayinsensitive Specifications
 In Proc. International Symposium on Advanced Research in Asynchronous Circuits and Systems
, 1997
"... An advantage of algebraic specifications of delay insensitive asynchronous processes over most other formalisms is that it allows the recursive definition of processes, and correctness proofs of an implementation through fixpoint induction. On the other hand, proofs by fixpoint induction are intrins ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
An advantage of algebraic specifications of delay insensitive asynchronous processes over most other formalisms is that it allows the recursive definition of processes, and correctness proofs of an implementation through fixpoint induction. On the other hand, proofs by fixpoint induction are intrinsically hard to design and read, which led us to use a much more palatable proof style, using socalled linear proofs and induction. Until now, the intuitive induction rule has never been formalized, and formalizing it, as we do in this paper, shows that extreme care has to be taken to phrase the proof rule that is being used. Fortunately, the rules that we derive in this paper validate the proofs that used the intuitive notion, and its formulation is such that it can easily be included in theorem provers and other tools. 0. Introduction DIalgebra [JU90] [Luc94] is an algebra that has been designed for the specification and derivation of delay Copyright 1998 IEEE. Published in the Proce...
Metric Denotational Semantics for
 Proceedings of the Fourth Annual Workshop on Process Algebra and Performance Modelling
, 1996
"... Stochastic process algebras, which combine the features of a process calculus with stochastic analysis, were introduced to enable compositional performance analysis of systems. At the level of syntax, compositionality presents itself in terms of operators, which can be used to build more complex ..."
Abstract
 Add to MetaCart
Stochastic process algebras, which combine the features of a process calculus with stochastic analysis, were introduced to enable compositional performance analysis of systems. At the level of syntax, compositionality presents itself in terms of operators, which can be used to build more complex systems from simple components. Denotational semantics is a method for assigning to syntactic objects elements of a suitably chosen semantic domain. This is compositional in style, as operators are represented by certain functions on the domain, and often allows to gain additional insight by considering the properties of those functions. We consider Performance Evaluation Process Algebra (PEPA), a stochastic process algebra introduced by Hillston [9].