Simulating Truly Concurrent CSP

Kleine, Moritz; Sanders, J. W.

doi:10.1007/978-3-642-19829-8_9

Search citation statements

Order By: Relevance

Paper Sections

Select...

Designing a Coordination Environment1

Duration Conflict and Concurrency1

Detecting Data Races1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2011

Publication Types

Select...

Book1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(3 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The ideas presented in the previous section are supported by the transformation T presented in [8]. The transformation splits events into start and end events, introduces fresh hidden actions for internal choices and timeouts, and takes internal transitions into account.…”

Section: Designing a Coordination Environmentmentioning

confidence: 95%

“…Interestingly, as shown in [8], the splitting of events allows us to distinguish choice from concurrency. In that paper, a syntactical transformation T of processes is presented that splits the events in its argument (even the hidden ones) of its input process into start and end events and relabels them in such a way that hidden transitions become observable again.…”

Section: Duration Conflict and Concurrencymentioning

confidence: 99%

“…Thus, we do not consider a particular specification language for the UDFs here and present a purely mathematical proof obligation to ensure freedom of data races in a coordinated system. It is defined as a so-called frame property, based on our notion of possible concurrency (as presented in [8]), describing the modification behavior of a UDF with respect to another UDF. Refer to [11] for a more in-depth presentation of framing.…”

Section: Detecting Data Racesmentioning

confidence: 99%

See 2 more Smart Citations