Process Algebra with Partial Choice

The objective of this paper is to bridge the gap between ACP and TCSP. To this end, ACP is extended with two non-deterministic choice operators in a setting of bisimulation semantics. With these operators, we can express safety properties of systems without the use of silent steps, and we can verify safety properties in a setting in which no assumption on fairness (or unfairness) has been made.

[1]  L. D. J. C. Loyens,et al.  ILIAS : a sequential language for parallel matrix computations , 1993 .

[2]  Kim G. Larsen,et al.  A modal process logic , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[3]  Jos C. M. Baeten,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates , 1993, CONCUR.

[4]  Gerard Zwaan,et al.  A taxonomy of keyword pattern matching algorithms , 1992 .

[5]  Fairouz Kamareddine,et al.  A System at the Cross-Roads of Functional and Logic Programming , 1992, Sci. Comput. Program..

[6]  Hans A. Hansson.  Time and probability in formal design of distributed systems , 1991, DoCS.

[7]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[8]  Fairouz Kamareddine,et al.  Non well-foundedness and type freeness can unify the interpretation of functional application , 1992 .

[9]  Pmp Paul Rambags,et al.  Composition and Decomposition in a CPN Model , 1992 .

[10]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[11]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[12]  Erik Poll,et al.  Some categorical properties for a model for second order lambda calculus with subtyping , 1991 .

[13]  Fairouz Kamareddine,et al.  A unified approach to type theory through a refined lambda-calculus , 1992 .

[14]  J. Zwiers,et al.  Assertional Data Reification Proofs: Survey and Perspective , 1991 .

[15]  Jan A. Bergstra,et al.  Axiomatizing Probabilistic Processes: ACP with Generative Probabilities , 1995, Inf. Comput..

[16]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[17]  van Km Kees Hee,et al.  Systems engineering : a formal approach. Part I. System concepts , 1993 .

[18]  Jan A. Bergstra,et al.  Global Renaming Operators in Concrete Process Algebra , 1988, Inf. Comput..

[19]  P. D. Moerland,et al.  Exercises in multiprogramming , 1993 .

[20]  Jan A. Bergstra,et al.  Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract) , 1992, CONCUR.

[21]  J. W. de Bakker,et al.  Processes and the Denotational Semantics of Concurrency , 1982, Inf. Control..

[22]  Jan A. Bergstra,et al.  Real time process algebra with infinitesimals , 1993 .

[23]  Jan A. Bergstra,et al.  Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator , 1987, Comput. J..

[24]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[25]  Jan A. Bergstra,et al.  Readies and Failures in the Algebra of Communicating Processes , 1988, SIAM J. Comput..

[26]  Bengt Jonsson,et al.  A calculus for communicating systems with time and probabilities , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.