Ready to preorder: an algebraic and general proof

Frutos-Escrig, David de; Rodríguez, Carlos; Palomino, Miguel

doi:10.1016/j.jlap.2008.09.001

Cited by 11 publications

(39 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [16], Chen, Fokkink and van Glabbeek have provided an extension to weak process semantics of the 'ready to preorder' procedure for generating axiomatizations of process equivalences from those of their underlying preorders, first studied in [3,20]. It would be worthwhile to study whether the scope of the algorithm presented in [16] can be extended to cover the case of the weak ready simulation congruence in Definition 4 and related semantics.…”

Section: Resultsmentioning

confidence: 99%

“…RS appears as a necessary condition for process semantics in many general results in process theory-see, e.g. [3,19,20,30]. As for equation τg, this is indeed a simple and natural one that is satisfied by any 'natural' precongruence on processes with silent moves.…”

Section: Proposition 6 the Set Of Equationsmentioning

confidence: 96%

“…To obtain a ground-complete axiomatization of the largest congruence included in weak ready simulation equivalence, it would be desirable to use a general 'ready-to-preorder result' [3,20] as the one we have for the concrete case. There is indeed a similar result for weak semantics by Chen, Fokkink and van Glabbeek, see [16], but unfortunately it is not general enough to cover the case of the weak ready simulation congruence in Definition 4.…”

Section: Theorem 2 the Set Of Non-conditional Equations Defined Bymentioning

confidence: 99%

See 2 more Smart Citations

Axiomatizing Weak Ready Simulation Semantics over BCCSP

Aceto

Frutos-Escrig

Gregorio-Rodríguez

et al. 2011

Theoretical Aspects of Computing – ICTAC 2011

View full text Add to dashboard Cite

Abstract. Ready simulation has proven to be one of the most significant semantics in process theory. It is at the heart of a number of general results that pave the way to a comprehensive understanding of the spectrum of process semantics. Since its original definition by Bloom, Istrail and Meyer in 1995, several authors have proposed generalizations of ready simulation to deal with internal actions. However, a thorough study of the (non-)existence of finite (in)equational bases for weak ready simulation semantics is still missing in the literature. This paper presents a complete account of positive and negative results on the axiomatizability of weak ready simulation semantics over the language BCCSP. In addition, this study offers a thorough analysis of the axiomatizability properties of weak simulation semantics.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Proposition 6 the Set Of Equationsmentioning

confidence: 96%

Section: Theorem 2 the Set Of Non-conditional Equations Defined Bymentioning

confidence: 99%

See 1 more Smart Citation

Axiomatizing Weak Ready Simulation Semantics over BCCSP

Aceto

Frutos-Escrig

Gregorio-Rodríguez

et al. 2011

Theoretical Aspects of Computing – ICTAC 2011

View full text Add to dashboard Cite

show abstract

“…RS also appears as a necessary condition for process semantics in many general results in process theory-see, e.g. [5,21,22].…”

Section: Lemma 14 If P Rs Q Then P Rs τQmentioning

confidence: 99%

“…To obtain a ground-complete axiomatization of the largest congruence included in weak ready simulation equivalence, it would be desirable to use a general 'ready-to-preorder result' [5,22] as the one we have for the concrete case. There is indeed a similar result for weak semantics by Chen, Fokkink and van Glabbeek, see [18], but unfortunately it is not general enough to cover the case of the weak ready simulation congruence in Definition 12.…”

Section: Proposition 21mentioning

confidence: 99%

Axiomatizing weak simulation semantics over BCCSP

Aceto¹,

Frutos-Escrig²,

Gregorio-Rodríguez³

et al. 2014

Theoretical Computer Science

View full text Add to dashboard Cite

Abstract. This paper is devoted to the study of the (in)equational theory of the largest (pre)congruences over the language BCCSP induced by variations on the classic simulation preorder and equivalence that abstract from internal steps in process behaviours. In particular, the article focuses on the (pre)congruences associated with the weak simulation, the weak complete simulation and the weak ready simulation preorders. For each of these behavioural semantics, results on the (non)existence of finite (ground-)complete (in)equational axiomatizations are given. The axiomatization of those semantics using conditional equations is also discussed in some detail.

show abstract