2003
DOI: 10.1017/s0960129503004006
|View full text |Cite
|
Sign up to set email alerts
|

Embedding untimed into timed process algebra: the case for explicit termination

Abstract: In ACP-style process algebra the interpretation of a constant atomic action combines action execution with termination. In a setting with timing, different forms of termination can be distinguished: some-time termination, termination before the next clock tick, urgent termination, having terminated. In a setting with the silent action τ, we also have silent termination. This leads to problems with the interpretation of atomic actions in timed theories that involve some form of the empty process or some form of… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
19
0

Year Published

2004
2004
2015
2015

Publication Types

Select...
5
3
1

Relationship

1
8

Authors

Journals

citations
Cited by 14 publications
(19 citation statements)
references
References 53 publications
0
19
0
Order By: Relevance
“…As a first contribution of this paper, our study gives concrete form to the development of a common theory of process algebra: we introduce a process algebra called TCP+REC, which is defined in such a way that each basic mechanism involved in the operators of the three process algebras is directly expressed by a different operator. More precisely, this algebra extends the algebra TCP (Baeten 2003;Baeten et al 2008) (which extends ACP by including successful termination 1 and prefixingà la CCS) by the inclusion of a recursion operator X|E that computes the least transition relation satisfying a system of recursive equations (denoted E = {X = t X , Y = t Y , . .…”
Section: Introductionmentioning
confidence: 99%
“…As a first contribution of this paper, our study gives concrete form to the development of a common theory of process algebra: we introduce a process algebra called TCP+REC, which is defined in such a way that each basic mechanism involved in the operators of the three process algebras is directly expressed by a different operator. More precisely, this algebra extends the algebra TCP (Baeten 2003;Baeten et al 2008) (which extends ACP by including successful termination 1 and prefixingà la CCS) by the inclusion of a recursion operator X|E that computes the least transition relation satisfying a system of recursive equations (denoted E = {X = t X , Y = t Y , . .…”
Section: Introductionmentioning
confidence: 99%
“…It is well known that bisimilarity is axiomatized by the axiom system E 1 over T (Σ 1 P )-see, e.g., [3].…”
Section: Definition 31 (Normal Formmentioning
confidence: 99%
“…The algebra TCP+REC is an extension of the algebra TCP [1,2] which in turn extends ACP by including successful termination and prefixingà la CCS. The algebra TCP is parameterized on a set of actions A (which does not include the special internal action τ ) and is endowed with sequencing "t · t ", hiding "τ I (t)", restriction "∂ H (t)", relabeling "ρ f (t)", and parallel composition "t t "à la ACP (where a communication function γ is assumed to compute the type of communicating actions).…”
Section: The Generic Process Algebra Tcp+recmentioning
confidence: 99%