#### DMCA

## UNIFYING THE LINEAR TIME-BRANCHING TIME SPECTRUM OF STRONG PROCESS SEMANTICS (2012)

### Citations

4170 | Communicating Sequential Processes
- Hoare
- 1985
(Show Context)
Citation Context ...rt our study with a very representative and well-known group of semantics in the spectrum, each of which has been developed and used in important work in the area: ready simulation [38, 13], failures =-=[14, 32]-=-, readiness [43], ready trace [9] and failure traces [44]. 3.1.1. Semantic preorders. As already hinted above, the dynamic part of the semantics is inherited from a simulation preorder. As stated in o... |

236 | Bisimulation can’t be traced
- Bloom, Istrail, et al.
- 1995
(Show Context)
Citation Context ...r semantics. We start our study with a very representative and well-known group of semantics in the spectrum, each of which has been developed and used in important work in the area: ready simulation =-=[38, 13]-=-, failures [14, 32], readiness [43], ready trace [9] and failure traces [44]. 3.1.1. Semantic preorders. As already hinted above, the dynamic part of the semantics is inherited from a simulation preor... |

82 | A brief history of process algebra
- Baeten
- 2004
(Show Context)
Citation Context ...hat has inspired us. The number of contributions is too large to cite all of them here. Anyone interested on finding a more exhaustive list of relevant references may collect them, for instance, from =-=[28, 7, 1, 57, 50]-=-. There the historic evolution of the area and many of the most important contributions to it are reviewed. To them we can add four recent books on process algebras and related subjects [8, 49, 6, 51]... |

80 | Testing Equivalence as a Bisimulation Equivalence
- Cleaveland, Hennessy
- 1993
(Show Context)
Citation Context ...ey are derived, that enhances our understanding of the features of each of the semantics and the relationships between them. These presentations somehow generalize the work by Cleaveland and Hennessy =-=[17]-=- on the characterization of the Testing semantics by means of bisimulation. There is also a clear connection with the work by two of the authors of this paper on (Bi)simulation up-to [25]. • A concomi... |

38 |
Reactive Systems: Modelling, Specification and Verification.
- Aceto, Inglfsdttir, et al.
- 2007
(Show Context)
Citation Context ... 7, 1, 57, 50]. There the historic evolution of the area and many of the most important contributions to it are reviewed. To them we can add four recent books on process algebras and related subjects =-=[8, 49, 6, 51]-=-, presenting different points of view and some of the semantics studied in this paper. Finally, in our Conclusions, we will discuss a bit the work on the generic study and classification of the weak s... |

32 |
Ready-trace semantics for concrete process algebra with the priority operator.
- Baeten, Bergstra, et al.
- 1987
(Show Context)
Citation Context ...e and well-known group of semantics in the spectrum, each of which has been developed and used in important work in the area: ready simulation [38, 13], failures [14, 32], readiness [43], ready trace =-=[9]-=- and failure traces [44]. 3.1.1. Semantic preorders. As already hinted above, the dynamic part of the semantics is inherited from a simulation preorder. As stated in our Introduction, bisimilarity can... |

30 | Finite equational bases in process algebra: Results and open questions
- Aceto, Fokkink, et al.
- 2005
(Show Context)
Citation Context ...logical and practical implications that have been explored along the last years by the authors of this work, for example in [22, 24, 25, 20, 21], and also in work by important researchers in the area =-=[5, 4, 16, 40]-=-. This research shows that a unified view of process semantics is indeed possible. This is precisely the main goal we set to reach with our work: we aim to study process semantics in a generic way, ma... |

10 |
On the unification of process semantics: Equational semantics.
- Frutos-Escrig, Gregorio-Rodrıguez, et al.
- 2009
(Show Context)
Citation Context ...icular application. 1.1. Overview of results. This paper contains a consolidated and extended presentation of the unification of observational, equational and the logic process semantics published in =-=[20, 19, 47]-=- for strong behavioral semantics. 2 We take advantage of the joint and larger presentation of the subject to tighten the connections between the different views. Besides, we make the paper mostly self... |

9 | Some of my favourite results in classic process algebra
- Aceto
- 2003
(Show Context)
Citation Context ...hat has inspired us. The number of contributions is too large to cite all of them here. Anyone interested on finding a more exhaustive list of relevant references may collect them, for instance, from =-=[28, 7, 1, 57, 50]-=-. There the historic evolution of the area and many of the most important contributions to it are reviewed. To them we can add four recent books on process algebras and related subjects [8, 49, 6, 51]... |

7 |
Bergstra and Jan Willem Klop. Process algebra for synchronous communication
- Jan
- 1984
(Show Context)
Citation Context ...them. Among the most relevant work are those of Matthew Hennessy [30], who introduced the testing methodology defining process semantics from test cases, and those of Jan Bergstra and Jan Willen Klop =-=[11]-=-, later continued by Jos Baeten and Peter Weijland [10], which were based on an axiomatic approach. Theseproposalsdefinealgebraiclanguagesforthespecificationofprocesses, divergingin subtle details con... |

6 |
de Frutos-Escrig and Carlos Gregorio-Rodríguez. Bisimulations up-to for the linear timebranching time spectrum
- David
- 2005
(Show Context)
Citation Context ...lar, in [16] it is proved that it is possible to apply to weak semantics the algorithm to obtain axiomatic characterizations of semantic equivalences from the axioms for corresponding order [21]. And =-=[2, 3]-=- provides a detailed study of the axiomatization of weak simulation semantics. Let us also cite here the recent work by Anti Valmari [53], where he presents the full catalogue of (weak) linear-time co... |

6 | Ready to preorder: The case of weak process semantics.
- Chen, Fokkink, et al.
- 2008
(Show Context)
Citation Context ...logical and practical implications that have been explored along the last years by the authors of this work, for example in [22, 24, 25, 20, 21], and also in work by important researchers in the area =-=[5, 4, 16, 40]-=-. This research shows that a unified view of process semantics is indeed possible. This is precisely the main goal we set to reach with our work: we aim to study process semantics in a generic way, ma... |

4 |
Coinductive characterisations reveal nice relations between preorders and equivalences
- Frutos-Escrig, Gregorio-Rodŕıguez, et al.
- 2008
(Show Context)
Citation Context ...e these results we can compare the new and old axiomatizations similarly as we did in the proof of Proposition 3.5 or alternatively make use of the “ready to preorder” algorithm thoroughly studied in =-=[4, 18, 21]-=-. The results in this section clarify the entanglement between axiomatizations for preorders and equivalences. For example: for the ready simulation and its associated linear semantics, wejustneedthre... |

2 | and Pekka Pihlajasaari, editors. Theoretical Aspects of Computing - Cerone - 2011 |

2 |
On the unification of process semantics: Observational semantics
- Frutos-Escrig, Gregorio-Rodŕıguez, et al.
(Show Context)
Citation Context ...which are undoubtedly related. A unified study of semantics has both methodological and practical implications that have been explored along the last years by the authors of this work, for example in =-=[22, 24, 25, 20, 21]-=-, and also in work by important researchers in the area [5, 4, 16, 40]. This research shows that a unified view of process semantics is indeed possible. This is precisely the main goal we set to reach... |

1 |
Theequational theory of weak complete simulation semantics over bccsp
- LucaAceto, Gregorio-Rodríguez, et al.
(Show Context)
Citation Context ...lar, in [16] it is proved that it is possible to apply to weak semantics the algorithm to obtain axiomatic characterizations of semantic equivalences from the axioms for corresponding order [21]. And =-=[2, 3]-=- provides a detailed study of the axiomatization of weak simulation semantics. Let us also cite here the recent work by Anti Valmari [53], where he presents the full catalogue of (weak) linear-time co... |

1 |
Ready to preorder: get your BCCSP axiomatization forfree
- Aceto, Fokkink, et al.
- 2007
(Show Context)
Citation Context ...logical and practical implications that have been explored along the last years by the authors of this work, for example in [22, 24, 25, 20, 21], and also in work by important researchers in the area =-=[5, 4, 16, 40]-=-. This research shows that a unified view of process semantics is indeed possible. This is precisely the main goal we set to reach with our work: we aim to study process semantics in a generic way, ma... |