Resource traces: a domain for processes sharing exclusive resources

Gastin, Paul; Teodosiu, Dan

doi:10.1016/s0304-3975(00)00336-4

Cited by 8 publications

(10 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These results are reported in [2]. In addition to the results in [2], the collaborators have extended the language to include the hiding operator of CSP and nondeterministic choice, both of which require a denotational model from the more general setting of pomsets, rather than the setting of resource traces of [3].…”

Section: Semantic Models For Concurrencymentioning

confidence: 91%

“…Recently Gastin and Teodesiu developed models for trace theory that are cpos in which the concatenation operator is Scott continuous [3]. The research supported under this grant uses the work of Gastin and Teodosiu to devise a denotational model for a language in which the basic operation for composing processes is the concatenation operator of trace theory.…”

Section: Semantic Models For Concurrencymentioning

confidence: 99%

See 1 more Smart Citation

Towards architectural invariants of evolving systems

Minsky

2000

SIGSOFT Softw. Eng. Notes

View full text Add to dashboard Cite

Section: Semantic Models For Concurrencymentioning

confidence: 91%

Section: Semantic Models For Concurrencymentioning

confidence: 99%

Towards architectural invariants of evolving systems

Minsky

2000

SIGSOFT Softw. Eng. Notes

View full text Add to dashboard Cite

“…This opens the way to giving truly concurrent denotational semantics for parallel languages using trace theory. In this paper, we have chosen to use the resource traces model of Gastin and Teodosiu (2002) as the basis for the denotational model for our language. In this approach, things are a bit more concrete than described above.…”

Section: Resource Tracesmentioning

confidence: 99%

“…The goal is to present an operational and denotational model for this language based on the resource traces model of Gastin and Teodosiu (2002). We begin once again with a finite set Σ of atomic actions, a finite set R of resources, and a mapping res: Σ → P(R) that assigns to each a ∈ Σ a non-empty set of resources.…”

Section: The Languagementioning

confidence: 99%

“…But our model has additional properties not found in the existing models. It is based on the resource traces model of Gastin and Teodosiu (2002), which is a domain-theoretic generalisation of Mazurkiewicz traces (Mazurkiewicz 1987) in which the concatenation operator has a continuous interpretation. We augment this domain with continuous interpretations for the other operators from our language.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A simple process algebra based on atomic actions with resources

Gastin

Mislove

2004

Math. Struct. Comp. Sci.

Self Cite

View full text Add to dashboard Cite

This paper initiates the study of a process algebra based on atomic actions that are assigned resources, and that supports true concurrency. By true concurrency we mean that the parallel composition of concurrent processes does not rely on an interleaving of concurrent actions for its definition. Our process algebra includes a number of interesting operators that can be defined using resources of atomic actions to control their behaviour: of particular note is a (weak) sequential composition operator that exploits the truly concurrent nature of the semantics; this operator extends significantly the operation of prefixing by atomic actions that is supported in most truly concurrent semantics. Our language also includes a parallel composition operator that allows local events to execute asynchronously, while requiring synchronising events to execute simultaneously. In addition, the language supports a restriction operator and includes (unguarded) recursion. We present both a denotational semantics and a companion operational semantics for our language. The denotational semantics supports true concurrency, so that parallel composition is defined without non-determinism or interleaving. This semantics also is novel for its treatment of recursion. The meaning of a recursive process is defined using a least fixed point on a subdomain that is determined by the body of the recursion, and that varies from one process to another. Nonetheless, the recursion operators in the language have continuous interpretations in the denotational model. In fact, our denotational model is based on a domain-theoretic generalisation of Mazurkiewicz traces in which the concatenation operator, as well as the other operators from our language, can be given continuous interpretations. The operational model is presented in a natural SOS style. We prove a congruence theorem relating the two semantics, which implies the operational model itself is compositional. The congruence theorem also implies the denotational model is adequate with respect to the operational semantics, and we characterise the relatively mild conditions under which the denotational semantics is fully abstract with respect to the operational semantics.

show abstract