scholarly journals Metric semantics for concurrency

1988 ◽  
Vol 28 (3) ◽  
pp. 504-529 ◽  
Author(s):  
J. W. de Bakker ◽  
J. -J. Ch. Meyer
Keyword(s):  
Metric Semantics

scholarly journals Metric semantics for true concurrent real time

2001 ◽  
Vol 254 (1-2) ◽  
pp. 501-542 ◽  
Author(s):  
Joost-Pieter Katoen ◽  
Christel Baier ◽  
Diego Latella
Keyword(s):  
Real Time ◽  
Metric Semantics

scholarly journals Rendez-vous with metric semantics

1993 ◽  
Vol 12 (1) ◽  
pp. 53-90 ◽  
Author(s):  
J. W. de Bakker ◽  
E. P. de Vink
Keyword(s):  
Metric Semantics

scholarly journals Fixed Points in Metric Semantics

2001 ◽  
Vol 40 ◽  
pp. 70-71
Author(s):  
J.W. de Bakker
Keyword(s):  
Fixed Points ◽  
Metric Semantics

Full Abstractness of a Metric Semantics for Action Refinement

1999 ◽  
Vol 40 (4) ◽  
pp. 335-382 ◽  
Author(s):  
J.I. den Hartog ◽  
E.P. de Vink ◽  
J.W. de Bakker
Keyword(s):  
Action Refinement ◽  
Metric Semantics

Metric semantics from partial order semantics

1997 ◽  
Vol 34 (9) ◽  
pp. 701-735 ◽  
Author(s):  
Christel Baier ◽  
Mila E. Majster-Cederbaum
Keyword(s):  
Partial Order ◽  
Metric Semantics ◽  
Partial Order Semantics

Domain equations for probabilistic processes

2000 ◽  
Vol 10 (6) ◽  
pp. 665-717 ◽  
Author(s):  
CHRISTEL BAIER ◽  
MARTA KWIATKOWSKA
Keyword(s):  
Metric Spaces ◽  
Operational Semantics ◽  
Denotational Semantics ◽  
Semantic Model ◽  
Transition Systems ◽  
Probabilistic Choice ◽  
Bisimulation Equivalence ◽  
Metric Semantics ◽  
Continuous Domains ◽  
Probabilistic Processes

In this paper we consider Milner's calculus CCS enriched by a probabilistic choice operator. The calculus is given operational semantics based on probabilistic transition systems. We define operational notions of preorder and equivalence as probabilistic extensions of the simulation preorder and the bisimulation equivalence respectively. We extend existing category-theoretic techniques for solving domain equations to the probabilistic case and give two denotational semantics for the calculus. The first, ‘smooth’, semantic model arises as a solution of a domain equation involving the probabilistic powerdomain and solved in the category CONT⊥ of continuous domains. The second model also involves an appropriately restricted probabilistic powerdomain, but is constructed in the category CUM of complete ultra-metric spaces, and hence is necessarily ‘discrete’. We show that the domain-theoretic semantics is fully abstract with respect to the simulation preorder, and that the metric semantics is fully abstract with respect to bisimulation.

Sign in / Sign up

Export Citation Format

Share Document