The connection between an event structure semantics and an operational semantics forTCSP

Baier, Christel; Majster-Cederbaum, Mila

doi:10.1007/bf01178923

Cited by 20 publications

(19 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This condition is satisÿed by the premises of assertion (1). For assertion (3) we have that ∈ A implies ∈ (P) by deÿnition. Since ÿ ∈ A by the current case and P is uniquely synchronized, we have ÿ ∈ (P) by Lemma 2.6 whence we may assume ÿ ∈ (Q) as requested by the premises of assertion (3).…”

Section: A1 Proof Of Lemma 223mentioning

confidence: 95%

“…Lemma 2.20 (see [3]). Let P; A 1 ; : : : ; A n ∈ G and let x 1 ; : : : ; x n ∈ Idf be pairwise distinct identiÿers which are guarded in P. Then we have:…”

Section: Deÿnition 24 (Alphabet-disjointness)mentioning

confidence: 96%

“…4 As the reÿnement of a (terminating) action by some inÿnite behaviour violates the intuition [26], no expression of the form ÿx(x = P) is allowed to occur in a term Q ∈ R . Deÿnition 2.19 (see [3]). Let P; A 1 ; : : : ; A n ∈ and x 1 ; : : : ; x n ∈ Idf be pairwise distinct identiÿers.…”

Section: Deÿnition 24 (Alphabet-disjointness)mentioning

confidence: 99%

“…The proof of [3] is easily adapted to the language G . Some elementary properties of the function red are summarized in the following which allow us to relate the behaviour of P and red(P[ ❀ Q]).…”

Section: Deÿnition 24 (Alphabet-disjointness)mentioning

confidence: 99%

“…The SAR-operator is denoted by ·[ ❀ Q] in the considered process language and logic and P[ ❀ Q], '[ ❀ Q] are considered to be hierarchical expressions. 3 P and Q are TCSP-like process terms and ' is a L-formula.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Towards the hierarchical verification of reactive systems

Majster-Cederbaum

Salger

2004

Theoretical Computer Science

View full text Add to dashboard Cite

The hierarchical design approach for action based systems that is known as action reÿnement has been studied in the literature extensively. In a paper of M. Huhn published in CONCUR 1996 a reÿnement operator on a linear time logic is presented that mimics precisely a semantic action reÿnement on synchronisation structures. We present here an alternative approach where our starting point is a process algebraic setting with a syntactic action reÿnement. We present a reÿnement operator on the Modal Mu-calculus that conforms with the process algebraic reÿne-ment in the following sense: Provided some reasonable conditions are met, the transition system induced by a process term P satisÿes a Modal Mu-Calculus-speciÿcation ' if and only if the system which is induced by a reÿnement of P satisÿes a particular reÿnement of '. Alleviating these conditions, we show that each of the two implications in the equivalence assertion above can be separately proven valid for a particular fragment of the Modal Mu-calculus. We demonstrate that the obtained results can indeed be used as a hierarchical veriÿcation technique. As a further application of our results, we explain how they can be employed as an abstraction technique in order to enhance model checking techniques.

show abstract

Section: A1 Proof Of Lemma 223mentioning

confidence: 95%

“…Lemma 2.20 (see [3]). Let P; A 1 ; : : : ; A n ∈ G and let x 1 ; : : : ; x n ∈ Idf be pairwise distinct identiÿers which are guarded in P. Then we have:…”

Section: Deÿnition 24 (Alphabet-disjointness)mentioning

confidence: 96%