2005
DOI: 10.1007/11601548_18
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: Abstract. Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equivalences for finitely branching, concrete, sequential processes. He studied these semantics in the setting of the basic process algebra BCCSP, and tried to give finite complete axiomatizations for them. Obtaining such axiomatizations in concurrency theory often turns out to be difficult, even in the setting of simple languages like BCCSP. This has raised a host of open questions that have been the subject of inten… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
37
0

Year Published

2006
2006
2011
2011

Publication Types

Select...
6

Relationship

4
2

Authors

Journals

citations
Cited by 36 publications
(37 citation statements)
references
References 31 publications
(44 reference statements)
0
37
0
Order By: Relevance
“…Classic axiomatizations for notions of bisimilarity The well-known axioms B 1 -B 4 for BCCSP(A τ ) given below stem from [27]. They are ω-complete [35], and sound and ground-complete [27,33], over BCCSP(A τ ) (over any nonempty set of actions) modulo bisimulation equivalence, which is the finest semantics in van Glabbeek's spectrum [23].…”
Section: Preorders and Their Kernelsmentioning
confidence: 99%
See 4 more Smart Citations
“…Classic axiomatizations for notions of bisimilarity The well-known axioms B 1 -B 4 for BCCSP(A τ ) given below stem from [27]. They are ω-complete [35], and sound and ground-complete [27,33], over BCCSP(A τ ) (over any nonempty set of actions) modulo bisimulation equivalence, which is the finest semantics in van Glabbeek's spectrum [23].…”
Section: Preorders and Their Kernelsmentioning
confidence: 99%
“…In what follows, for notational convenience, we consider terms up to the least congruence generated by axioms B 1 -B 4 , that is, up to bisimulation equivalence. We use summation ∑ n i=1 t i (with n ≥ 0) to denote t 1 + · · · + t n , where the empty sum denotes 0.…”
Section: Preorders and Their Kernelsmentioning
confidence: 99%
See 3 more Smart Citations