G. Norman. Metric Semantics for Reactive Probabilistic Processes. PhD thesis, School of Computer Science, University of Birmingham, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Linear Structures for Concurrency in Probabilistic.. - Di Pierro, Wiklicky (2001) (Correct)
....of probabilistic systems. Finally, we would like to mention the work on probabilistic process algebras (e.g. 4,31,68,7] for an overview see [38] which covers areas like probabilistic bisimulation [46,18] veri cation of probabilistic systems [5,33] and semantics of probabilistic systems [10,55,42]. 7 Conclusions and Further Work In this paper we have presented a generic approach to a denotational semantics for probabilistic concurrent languages which is based on linear structures. We have shown that linear operators, or more abstractly C algebras, constitute an appropriate semantical ....
Norman, G., Metric semantics for reactive probabilistic processes, Technical Report CSR-98-3, University of Birmingham, School of Computer Science (1998).
Model Checking for a Probabilistic Branching Time Logic With .. - Baier, Kwiatkowska (1998) (35 citations) (Correct)
.... logic framework, probabilistic extensions of equivalence relations and preorders have been investigated and applied to the specification and verification of probabilistic processes; most are suitable for the formulation 144 of qualitative and quantitative properties, see e.g. testing preorders [18, 39,47,48,60, 62], bisimulation [10, 36,41,42,55] and various kinds of simulations [8, 38, 55 57, 61] Several authors presented verification methods for proving qualitative properties of concurrent probabilistic systems (e.g. 2, 3, 19, 21, 32, 33, 49 51, 58, 59] but only a minority of them deal with ....
G.J. Norman. Metric semantics for reactive probabilistic processes. Ph.D Thesis, School of Computer Science, The University of Birmingham, November 1997
Model Checking for a Probabilistic Branching Time Logic with .. - Baier, Kwiatkowska (1998) (35 citations) (Correct)
.... logic framework, probabilistic extensions of equivalence relations and preorders have been investigated and applied to the specification and verification of probabilistic processes; most are suitable for the formulation of qualitative and quantitative properties, see e.g. testing preorders [18, 62, 60, 39, 48, 47], bisimulation [41, 42, 36, 55, 10] and various kinds of simulations [38, 55, 61, 56, 57, 8] Several authors presented verification methods for proving qualitative properties of concurrent probabilistic systems (e.g. 33, 49, 32, 58, 50, 59, 19, 2, 3, 51, 21] but only a minority of them deal ....
G.J. Norman. Metric semantics for reactive probabilistic processes. Ph.D Thesis, School of Computer Science, The University of Birmingham, November 1997.
A Testing Equivalence for Reactive Probabilistic Processes - Kwiatkowska, Norman (1998) (7 citations) Self-citation (Norman) (Correct)
....giving the probability of the process satisfying this formula. Each such formula is shown to correspond to a random experiment, and vice versa. We also show how a fixed point operator can be added to the quantitative HML. For full details of the results presented here the reader is referred to [23]. A fully abstract metric space denotational semantics for the calculus presented here can be found in [23,18] 2 A Testing Scenario with Random Experiments In this section, we first introduce reactive probabilistic transition systems which extend Larsen and Skou s probabilistic labelled ....
....to a random experiment, and vice versa. We also show how a fixed point operator can be added to the quantitative HML. For full details of the results presented here the reader is referred to [23] A fully abstract metric space denotational semantics for the calculus presented here can be found in [23,18]. 2 A Testing Scenario with Random Experiments In this section, we first introduce reactive probabilistic transition systems which extend Larsen and Skou s probabilistic labelled transition systems [19] by allowing processes of the system to exhibit three types of choice: internal ....
[Article contains additional citation context not shown here]
G.J. Norman. Metric semantics for reactive probabilistic processes. Ph.D Thesis, School of Computer Science, The University of Birmingham, November 1997.
A Fully Abstract Metric-Space Denotational Semantics for.. - Kwiatkowska, Norman (1998) (3 citations) Self-citation (Norman) (Correct)
....CSP operators (we are not able to deal with hiding and asynchronous parallel) We then formulate a metric space denotational semantics based on the constructions of de Bakker and Zucker [3] and show it is fully abstract, in the sense that it maps equivalent processes on to the same denotation. In [13,20] the equivalence considered here is endowed with a logical characterization in terms of the quantitative variant of the Hennessy Milner Logic introduced in [9] This completes the work started in [9] by characterizing the equivalence induced by (a variant of) the quantitative HML. Related ....
....and Kwiatkowska [2] for full CCS extended with action guarded probabilistic choice. 2 The Model and Testing Equivalence In this section we overview the definitions necessary for the technical development included in the remainder of this paper; for detailed justification of the constructions see [13,20]. First, we recall the definition of our model, called reactive probabilistic transition systems, which extend Larsen and Skou s probabilistic labelled transition systems [14] by allowing processes of the system to exhibit three types of choice: internal action guarded) probabilistic, external ....
[Article contains additional citation context not shown here]
G.J. Norman. Metric semantics for reactive probabilistic processes. Ph.D Thesis, School of Computer Science, the University of Birmingham, November 1997.
Implementation of Symbolic Model Checking for Probabilistic.. - Parker (1999) (5 citations) (Correct)
No context found.
G. Norman. Metric Semantics for Reactive Probabilistic Processes. PhD thesis, School of Computer Science, University of Birmingham, 1997.
Probabilistic Automata: System Types, Parallel Composition.. - Sokolova, de Vink (Correct)
No context found.
G. Norman, Metric semantics for reactive probabilistic processes, Ph.D. thesis, School of Computer Science, University of Birmingham, 1997.
A Fully Abstract Metric-Space Denotational Semantics for.. - Kwiatkowska, Norman (1998) (3 citations) (Correct)
No context found.
G.J. Norman. Metric semantics for reactive probabilistic processes. Ph.D Thesis, School of Computer Science, the University of Birmingham, November 1997.
Model Checking for a Probabilistic Branching Time Logic with .. - Baier, Kwiatkowska (1998) (35 citations) (Correct)
No context found.
G.J. Norman. Metric semantics for reactive probabilistic processes. Ph.D Thesis, School of Computer Science, The University of Birmingham, November 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