Axiomatizing GSOS with termination

Baeten, J.C.M.; Vink, de Ep Erik

doi:10.1016/j.jlap.2004.03.001

Cited by 23 publications

(25 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Following the developments in [1,12,44], it would also be interesting to study rule formats for operational semantics that provide congruence formats for the semantics considered in this paper, and to give procedures for generating ground-complete axiomatizations for them for process languages in the given formats.…”

Section: Resultsmentioning

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

Section: Resultsmentioning

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

show abstract

“…Following the developments in [1,5,21], it would also be interesting to study rule formats for operational semantics that provide congruence formats for the semantics considered in this paper, and to give procedures for generating ground-complete axiomatizations for them for process languages in the given formats.…”

Section: Resultsmentioning

confidence: 99%

The Equational Theory of Weak Complete Simulation Semantics over BCCSP

Aceto

Frutos-Escrig

Gregorio-Rodríguez

et al. 2012

SOFSEM 2012: Theory and Practice of Computer Science

View full text Add to dashboard Cite

Abstract. This paper presents a complete account of positive and negative results on the finite axiomatizability of weak complete simulation semantics over the language BCCSP. We offer finite (un)conditional groundcomplete axiomatizations for the weak complete simulation precongruence. In sharp contrast to this positive result, we prove that, in the presence of at least one observable action, the (in)equational theory of the weak complete simulation precongruence over BCCSP does not have a finite (in)equational basis. In fact, the collection of (in)equations in at most one variable that hold in weak complete simulation semantics over BCCSP does not have an (in)equational basis of 'bounded depth', let alone a finite one.

show abstract

“…Following the developments in [1,10,37], it would also be interesting to study rule formats for operational semantics that provide congruence formats for the semantics considered in this paper, and to give procedures for generating ground-complete axiomatizations for them for process languages in the given formats.…”

Section: Resultsmentioning

confidence: 99%

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

Axiomatizing GSOS with termination

Cited by 23 publications

References 23 publications

Axiomatizing weak simulation semantics over BCCSP

Axiomatizing weak simulation semantics over BCCSP

The Equational Theory of Weak Complete Simulation Semantics over BCCSP

Axiomatizing Weak Ready Simulation Semantics over BCCSP

Contact Info

Product

Resources

About