Notions of bisimulation and congruence formats for SOS with data

Mousavi, Mohammad Reza; Reniers, Michel A.; Groote, Jan Friso

doi:10.1016/j.ic.2005.03.002

Cited by 35 publications

(48 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, different from bisimulation equivalence as defined above, that variant would not even be a congruence with respect to the simplest strategic interleaving operator added to BPPA in this paper. In the terminology of [MRG05], bisimulation equivalence as defined above is stateless bisimulation equivalence and the intended variant is initially stateless bisimulation equivalence.…”

Section: Structural Operational Semanticsmentioning

confidence: 99%

Thread algebra for strategic interleaving

2007

View full text Add to dashboard Cite

Abstract. We take a thread as the behavior of a sequential deterministic program under execution and multi-threading as the form of concurrency provided by contemporary programming languages such as Java and C#. We outline an algebraic theory about threads and multi-threading. In the case of multi-threading, some deterministic interleaving strategy determines how threads are interleaved. Interleaving operators for a number of plausible interleaving strategies are specified in a simple and concise way. By that, we show that it is essentially open-ended what counts as an interleaving strategy. We use deadlock freedom as an example to show that there are properties of multi-threaded programs that depend on the interleaving strategy used.

show abstract

Section: Structural Operational Semanticsmentioning

confidence: 99%

Thread algebra for strategic interleaving

2007

View full text Add to dashboard Cite

show abstract

“…To our knowledge, this cannot be established by means of results from the theory of structural operational semantics concerning transition rule formats guaranteeing that some version of bisimilarity is a congruence. It appears that some results from [25,26] are the nearest obtainable, but there are still difficult issues that must be dealt with. One of those issues is that Theorem 34 from [26] is not applicable for the following reason: in the third transition rule from Table 10,…”

Section: Structural Operational Semantics Of Ta * Scmentioning

confidence: 99%

“…It appears that some results from [25,26] are the nearest obtainable, but there are still difficult issues that must be dealt with. One of those issues is that Theorem 34 from [26] is not applicable for the following reason: in the third transition rule from Table 10,…”

Section: Structural Operational Semantics Of Ta * Scmentioning

confidence: 99%

“…We believe that this point does not mean that the version of bisimilarity concerned is not a congruence, but that sufficient conditions for it that are weaker than the ones from the above-mentioned theorem must be found. Another issue is that transition labels containing terms are found in the structural operational semantics of TA * sc : this is not covered in [26]. We believe that adaptation on the lines of [25] is possible, but it is not a trivial matter.…”

Section: Structural Operational Semantics Of Ta * Scmentioning

confidence: 99%

See 1 more Smart Citation

Synchronous cooperation for explicit multi-threading

Bergstra

Middelburg

2007

Acta Informatica

View full text Add to dashboard Cite

We develop an algebraic theory of threads, synchronous cooperation of threads and interaction of threads with Maurer machines, and investigate program parallelization using the resulting theory. Program parallelization underlies techniques for speeding up instruction processing on a computer that make use of the abilities of the computer to process instructions simultaneously in cases where the state changes involved do no influence each other. One of our findings is that a strong induction principle is needed when proving theorems about sufficient conditions for the correctness of program parallelizations. The induction principle introduced has brought us to construct a projective limit model for the theory developed.

show abstract

“…Stateless bisimilarity [5,8,13,19] is a variation on the classic notion of bisimilarity [17,20] that is suitable for reasoning compositionally about open, concurrent and state-bearing systems. It is the finest notion of bisimilarity for state-bearing processes that one can find in the literature and comes equipped with a congruence rule format for operational rules [19].…”

mentioning

confidence: 99%

A ground-complete axiomatization of stateless bisimilarity over Linda

Aceto

Goriac

Ingólfsdóttir

2015

Information Processing Letters

View full text Add to dashboard Cite

This paper offers a finite, ground-complete axiomatization of stateless bisimilarity over the tuple-space-based coordination language Linda. As stepping stones towards that result, axiomatizations of stateless bisimilarity over the sequential fragment of Linda without the nask primitive, and over the full sequential sublanguage are given. It is also shown that stateless bisimilarity coincides with standard bisimilarity over the sequential fragment of Linda without the nask primitive.

show abstract

Notions of bisimulation and congruence formats for SOS with data

Cited by 35 publications

References 19 publications

Thread algebra for strategic interleaving

Thread algebra for strategic interleaving

Synchronous cooperation for explicit multi-threading

A ground-complete axiomatization of stateless bisimilarity over Linda

Contact Info

Product

Resources

About