A structural induction theorem for processes
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Process algebra
Modular specification of process algebras
Theoretical Computer Science
Formal verification of a leader election protocol in process algebra
ACP '95 Proceedings from the international workshop on Algebra of communicating processes
Grid protocols based on synchronous communication
Science of Computer Programming - Special issue on COST 247, verification and validation methods for formal descriptions
Communication and Concurrency
A Computer-Checked Verification of Milner's Scheduler
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Proof Theory for muCRL: A Language for Processes with Data
Proceedings of the International Workshop on Semantics of Specification Languages (SoSL)
Invariants in Process Algebra with Data
CONCUR '94 Proceedings of the Concurrency Theory
A Structural Linearization Principle for Processes
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Process Algebra with Combinators
CSL '93 Selected Papers from the 7th Workshop on Computer Science Logic
Focus Points and Convergent Process Operators
Focus Points and Convergent Process Operators
Fundamenta Informaticae
Cones and foci: A mechanical framework for protocol verification
Formal Methods in System Design
Multiparty Contract Signing Over a Reliable Network
Electronic Notes in Theoretical Computer Science (ENTCS)
Cones and foci for protocol verification revisited
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Fundamenta Informaticae
| Hi-index | 5.23 |
A general basis for the definition of a finite but unbounded number of parallel processes is the equation S(n; dt)=P(0; get(0; dt)) &Dgr; eq(n; 0). (P(n; get(n; dt)) //S(n− 1; dt)). In this formula eq(n; 0) is an equality test, and get(n; dt) denotes the nth data element in table dt. We derive a linear process equation with the same behaviour as S(n; dt), and show that this equation is well-defined, provided one adopts the principle CL-RSP from Bezem and Groote Proceedings of Concur'94, Springer, Berlin, 1994, pp. 401-416). In order to demonstrate the strength of our result, we use it for the analysis of a standard example. We show that n + 1 concatenated buffers form a queue of capacity n + 1. Copyright 2001 Elsevier Science B.V.