## A Fully Parallel Calculus of Synchronizing Processes (1993)

Venue: | In Proc. 5th TAPSOFT, Vol. 668 of LNCS |

Citations: | 1 - 1 self |

### BibTeX

@INPROCEEDINGS{Latella93afully,

author = {Diego Latella and Paola Quaglia},

title = {A Fully Parallel Calculus of Synchronizing Processes},

booktitle = {In Proc. 5th TAPSOFT, Vol. 668 of LNCS},

year = {1993},

publisher = {Springer-Verlag}

}

### OpenURL

### Abstract

. We propose a fully parallel calculus of synchronizing processes. The calculus was deeply inspired by LOTOS, of which it inherits multi-party synchronization in process parallel composition. On the other hand, its semantics is not interleaving whereas LOTOS one is. The model we propose is somehow in between Milner's SCCS and ASCCS in that independent actions are performed simultaneously, whereas synchronization is achieved by means of delay. Also, delay is controlled in the sense that no process can delay an action if the environment allows that action to be performed. The calculus we propose here was originally designed as a first step towards a probabilistic one. Nevertheless we think that the pure version of the calculus has some features which are interesting on their own. As an example we use it to describe a quite simple system which may be thought of as a possible fault tolerant architecture for a hardware component. We also provide a set of equational laws based o...

### Citations

3606 | Communicating sequential processes
- Hoare
- 1978
(Show Context)
Citation Context ...ministic choice, but rather from parallel composition. All the proposals for probabilistic process calculi mentioned above do not allow for multi-party synchronization, which is a main feature of CSP =-=[1]-=- and LOTOS [7] and is essential for modeling multi-/broad-casting. The only proposals for dealing with multi-party synchronization for probabilistic processes we know about are [3, 20]. Anyway they bo... |

1408 |
A Calculus of Communicating Systems
- Milner
- 1980
(Show Context)
Citation Context ...step towards a probabilistic one [11]. Several probabilistic models have been proposed in the literature [2, 4, 5, 6, 8, 13, 18, 21, 22]. They are derived mostly from SCCS [15] which, contrary to CCS =-=[14]-=-, has a noninterleaving semantics. In fact, in order to reason about probabilistic systems, it is a crucial point to have a direct correspondence between choice operators in behaviour expressions and ... |

1360 | A Structural Approach to Operational Semantics
- Plotkin
- 1981
(Show Context)
Citation Context ..., we shall often let the same symbol denote both a multiset and the set of its elements, the intended meaning being clear from the context. 2 Operational Semantics We define the operational semantics =-=[17]-=- of the fully parallel calculus by means of an auxiliary set of axioms and deduction rules (Fig.1) 2 which define the relations \Gamma! \Delta . Let BE be the set of the behaviour expressions; formall... |

693 |
Concurrency and automata on infinite sequences
- Park
- 1981
(Show Context)
Citation Context ...---? e] --? s!FAIL;Comp[is,s] ) endproc Fig. 5. Specification of process Comp 4 Strong Bisimulation Equivalence In the sequel we propose an adaptation of the notion of strong bisimulation equivalences=-=[14, 16]-=- to our model. In our calculus the minimal observational unit is the composite event, then: Definition6. A symmetric binary relation R ` BE \Theta BE is a strong bisimulation iff B1RB2 implies that 8f... |

421 | Bisimulation through probabilistic testing
- Larsen, Skou
- 1991
(Show Context)
Citation Context ... parallel calculus of synchronizing processes. The calculus was originally designed as a first step towards a probabilistic one [11]. Several probabilistic models have been proposed in the literature =-=[2, 4, 5, 6, 8, 13, 18, 21, 22]-=-. They are derived mostly from SCCS [15] which, contrary to CCS [14], has a noninterleaving semantics. In fact, in order to reason about probabilistic systems, it is a crucial point to have a direct c... |

327 |
Calculi for synchrony and asynchrony
- Milner
- 1983
(Show Context)
Citation Context ...ginally designed as a first step towards a probabilistic one [11]. Several probabilistic models have been proposed in the literature [2, 4, 5, 6, 8, 13, 18, 21, 22]. They are derived mostly from SCCS =-=[15]-=- which, contrary to CCS [14], has a noninterleaving semantics. In fact, in order to reason about probabilistic systems, it is a crucial point to have a direct correspondence between choice operators i... |

218 |
Information Processing Systems - Open Systems Interconnection - LOTOS - A Formal Description Technique Based on temporal Ordering
- ISO
- 1988
(Show Context)
Citation Context ...e, but rather from parallel composition. All the proposals for probabilistic process calculi mentioned above do not allow for multi-party synchronization, which is a main feature of CSP [1] and LOTOS =-=[7]-=- and is essential for modeling multi-/broad-casting. The only proposals for dealing with multi-party synchronization for probabilistic processes we know about are [3, 20]. Anyway they both are based o... |

97 | Algebraic reasoning for probabilistic concurrent systems
- Giacalone, Jou, et al.
- 1990
(Show Context)
Citation Context ... parallel calculus of synchronizing processes. The calculus was originally designed as a first step towards a probabilistic one [11]. Several probabilistic models have been proposed in the literature =-=[2, 4, 5, 6, 8, 13, 18, 21, 22]-=-. They are derived mostly from SCCS [15] which, contrary to CCS [14], has a noninterleaving semantics. In fact, in order to reason about probabilistic systems, it is a crucial point to have a direct c... |

96 |
A calculus for communicating systems with time and probabilities
- Hansson, Jonsson
- 1990
(Show Context)
Citation Context ... parallel calculus of synchronizing processes. The calculus was originally designed as a first step towards a probabilistic one [11]. Several probabilistic models have been proposed in the literature =-=[2, 4, 5, 6, 8, 13, 18, 21, 22]-=-. They are derived mostly from SCCS [15] which, contrary to CCS [14], has a noninterleaving semantics. In fact, in order to reason about probabilistic systems, it is a crucial point to have a direct c... |

71 |
Equivalences, congruences, and complete axiomatizations for probabilistic processes
- Jou, Smolka
- 1990
(Show Context)
Citation Context |

43 |
Testing equivalences and fully abstract models for probabilistic processes
- Christoff
- 1990
(Show Context)
Citation Context |

37 | Markov chain modelsâ€”rarity and exponentiality - Keilson - 1979 |

18 |
Testing Equivalences for Probabilistic Processes
- Christoff
- 1990
(Show Context)
Citation Context ...main feature of CSP [1] and LOTOS [7] and is essential for modeling multi-/broad-casting. The only proposals for dealing with multi-party synchronization for probabilistic processes we know about are =-=[3, 20]-=-. Anyway they both are based on interleaving semantics and force to assign the same (fictitious!) probability to all transitions of branches generated by parallel expressions. In our calculus, like in... |

18 | Priority as extremal probability
- Smolk, Steffen
- 1990
(Show Context)
Citation Context |

15 |
Performance description and analysis for distributed systems using a variant of LOTOS
- Rico, Bochman
- 1990
(Show Context)
Citation Context ...main feature of CSP [1] and LOTOS [7] and is essential for modeling multi-/broad-casting. The only proposals for dealing with multi-party synchronization for probabilistic processes we know about are =-=[3, 20]-=-. Anyway they both are based on interleaving semantics and force to assign the same (fictitious!) probability to all transitions of branches generated by parallel expressions. In our calculus, like in... |

5 |
Reasoning about probabilistic behavior in concurrent systems
- Purushothaman, Subrahmanyam
- 1987
(Show Context)
Citation Context |

3 |
Proposta per una variante probabilistica di LOTOS. Tesi di laurea in scienze dell'informazione, Universit`a degli Studi di
- Quaglia
- 1991
(Show Context)
Citation Context ...f the parallel composition when delayed on \Delta, we take under consideration only the transitions of B1 and B2 when they are delayed (at least) on \Delta [ Cant \Delta (B1jGjB2). 3 It can be proved =-=[19]-=- that 8 2 Gates, ifs2 Init \Delta (B) then 9ff 2 Ev : B ff \Gamma! \Delta ands2 ff: Init \Delta (stop) = ; Init \Delta (; B) = fg n \Delta Init \Delta (B1[ ]B2) = Init \Delta (B1) [ Init \Delta (B2) I... |

1 |
A fully parallel semantics for LOTOS. LotoSphere reference Lo/WP1/T1.2/CNUCE/N0023/V1
- Latella, Quaglia
- 1991
(Show Context)
Citation Context ... ff \Gamma! \Delta is a shorthand for 9B 0 : B ff \Gamma! \Delta B 0 . 1 The reader interested in the whole calculus is referred to [11]. 2 A first, simpler, version of this semantics is presented in =-=[10]-=-, there it is also shown that such a simple version is indeed unable to express external nondeterminism. (st) stop ffgg \Gamma! \Delta stop (a1) ; B ffgg \Gamma! \Delta B ; ifs62 \Delta (a2) ; B ffgg ... |

1 |
A Proposal for a Calculus of
- Latella, Quaglia
- 1991
(Show Context)
Citation Context ... of strong bisimulation. 1 Introduction In this paper we present a fully parallel calculus of synchronizing processes. The calculus was originally designed as a first step towards a probabilistic one =-=[11]-=-. Several probabilistic models have been proposed in the literature [2, 4, 5, 6, 8, 13, 18, 21, 22]. They are derived mostly from SCCS [15] which, contrary to CCS [14], has a noninterleaving semantics... |

1 |
A Calculus of Probabilistic Synchronizing
- Latella, Quaglia
- 1992
(Show Context)
Citation Context ...ve already mentioned before, this work is a part of the definition of a probabilistic calculus [11] which can be considered as an extension of the language defined in this paper. In the complete work =-=[12]-=- also examples of applications as well as relation with Markov theory are presented. With respect to the pure nondeterministic calculus we can refine the definition of the proposed operational semanti... |

1 |
A synchronous calculus of relative frequency. CONCUR 90, LNCS 458
- Tofts
- 1990
(Show Context)
Citation Context |