C. Baier and M.E. Majster-Cederbaum. How to interpret consistency and establish consistency results for semantics of concurrent programming languages. Fund. Inf., 29:225--256, 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Partial Order Models for Quantitative Extensions of LOTOS - Brinksma, Katoen.. (1997) (1 citation) (Correct)
....of [55] to recursive processes. 20] proves the consistency between an operational non interleaving semantics of CCS and denotational semantics based on labelled prime event structures. The notion of consistency between different semantics has been recently studied in a general framework in [7]. 7 Conclusions Our driving force is to study the expressiveness of partial order models, in particular event structures, to facilitate formal representation of performance and reliability aspects and to enable performance analysis of formal models in a systematic and (semi )automated way. In ....
C. Baier and M.E. Majster-Cederbaum. How to interpret consistency and establish consistency results for semantics of concurrent programming languages. Fund. Inf., 29:225--256, 1997.
Metric Semantics for True Concurrent Real Time - Christel Baier Joost-Pieter (1998) (1 citation) Self-citation (Baier) (Correct)
No context found.
C. Baier and M.E. Majster-Cederbaum. How to interpret consistency and establish consistency results for semantics of concurrent programming languages. Fund. Inf., 29:225--256, 1997.
Metric Semantics for True Concurrent Real Time - Katoen, Baier, Latella (1999) (1 citation) Self-citation (Baier) (Correct)
....structures that are finitely approximable. For time guarded hdecl; P i it follows that M cpo (decl; P ) is finitely approximable. Function f : TES fin Gamma TES fin = iso with f(E) df E E is a homomorphism between the PA algebras TES fin and TES fin = iso . Then, according to the results of [8], we obtain for any time guarded process hdecl; P i: f (M cpo (decl; P ) M(decl; P ) This entails that the presented metric semantics is significantly more abstract than the cpo based semantics of TGPA. 7 Concluding remarks In this paper we have extensively studied the use of a metric ....
C. Baier and M.E. Majster-Cederbaum. How to interpret consistency and establish consistency results for semantics of concurrent programming languages. Fund. Inf., 29:225--256, 1997.
Metric Semantics for True Concurrent Real Time - Baier, Katoen, Latella (1998) (1 citation) Self-citation (Baier) (Correct)
....that are finitely approximable. For time guarded hdecl; P i it follows that M cpo (hdecl; P i) is finitely approximable. Function f : TES fin Gamma TES fin = iso with f(E ) E E is a homomorphism between the PA algebras TES fin and TES fin = iso . Then, according to the results of [3], we obtain for any time guarded process hdecl; P i: f (M cpo (hdecl; P i) M cms (hdecl; P i) This entails that the presented metric semantics is significantly more abstract than the cpo based, and consequently, the operational semantics of TGPA. Related work. Several real time extensions of ....
C. Baier and M.E. Majster-Cederbaum. How to interpret consistency and establish consistency results for semantics of concurrent programming languages. Fund. Inf., 29:225--256, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC