(Enter summary)
Abstract: INTRODUCTION
Classic process, algebras such as CCS, CSP and ACP, are well-established
techniques for modelling and reasoning about functional aspects of concurrent
processes. The motivation for studying probabilistic extensions
of process algebras is to develop techniques dealing with non-functional
aspects of process behavior, such as performance and reliability. We may
want to investigate, e.g., the average response time of a system, or the
?
This chapter is dedicated to the fond memory of... (Update)
Cited by: More
A Framework for Analyzing Probabilistic - Protocols And Its
(Correct)
Simulation for Continuous-Time Markov Chains - Baier, Katoen, Hermanns.. (2002)
(Correct)
PROBMELA: a modeling language for communicating.. - Baier, Ciesinski, Größer (2004)
(Correct)
Similar documents (at the sentence level):
11.8%: Testing Preorders for Probabilistic Processes can be.. - Bengt Jonsson Wang (2000)
(Correct)
Active bibliography (related documents): More All
0.9: Probabilistic Automata: System Types, Parallel Composition.. - Sokolova, de Vink
(Correct)
0.6: Unknown - Fairness Is Concept
(Correct)
0.6: Alea jacta est - Verification of Probabilistic, Real-Time and.. - Stoelinga (2002)
(Correct)
Similar documents based on text: More All
0.5: Probabilistic Simulations for Probabilistic Processes - Segala, Lynch (1994)
(Correct)
0.3: Testing Theories for Asynchronous Languages - Castellani, Hennessy (1998)
(Correct)
0.2: Compositional Testing Preorders for Probabilistic Processes - Jonsson, Yi (1995)
(Correct)
Related documents from co-citation: More All
18: Probabilistic simulations for probabilistic processes
- Segala, Lynch - 1994
9: Bisimulation through probabilistic testing (context) - Larsen, Skou - 1989
8: Universal coalgebra: a theory of systems
- Rutten - 1999
BibTeX entry: (Update)
Bengt Jonsson, Kim G. Larsen, and Wang Yi. Probabilistic extensions of process algebras. In Jan A. Bergstra, Alban Ponse, and Scott A. Smolka, editors, Handbook of Process Algebra, pages 685-710. Elsevier, 2001. http://citeseer.ist.psu.edu/jonsson01probabilistic.html More
@misc{ jonsson01probabilistic,
author = "B. Jonsson and K. Larsen and W. Yi",
title = "Probabilistic extensions of process algebras",
text = "Bengt Jonsson, Kim G. Larsen, and Wang Yi. Probabilistic extensions of
process algebras. In Jan A. Bergstra, Alban Ponse, and Scott A. Smolka,
editors, Handbook of Process Algebra, pages 685-710. Elsevier, 2001.",
year = "2001",
url = "citeseer.ist.psu.edu/jonsson01probabilistic.html" }
Citations (may not include all citations):
1933
Communication and Concurrency (context) - Milner - 1989
1097
Automatic verification of finite-state concurrent systems us.. (context) - Clarke, Emerson et al. - 1983
906
A structural approach to operational semantics
- Plotkin - 1981
397
Design and synthesis of synchronization skeletons using bran.. (context) - Clarke, Emerson
357
Algebraic laws for nondeterminism and concurrency (context) - Hennessy, Milner - 1985
276
A Compositional Approach to Performance Modelling
- Hillston
247
Bisimulation through probabilistic testing (context) - Larsen, Skou - 1991
247
Bisimulation through probabilistic testing (context) - Larsen, Skou - 1989
174
Probabilistic simulations for probabilistic processes
- Segala, Lynch - 1995
149
Testing equivalences for processes (context) - de Nicola, Hennessy - 1984
129
Model checking of probabilistic and nondeterministic systems
- Bianco, De Alfaro - 1995
128
Automatic verification of probabilistic concurrent finite-st.. (context) - Vardi - 1985
122
Performance analysis using stochastic Petri nets (context) - Molloy - 1982
91
A calculus for communicating systems with time and probabili.. (context) - Hansson, Jonsson - 1990
87
A logic for reasoning about time and reliability
- Hansson, Jonsson - 1994
82
Finite State Markovian Decision Processes (context) - Derman - 1970
74
Symbolic model checking for probabilistic processes
- Baier, Kwiatkowska et al. - 1997
73
Algebraic reasoning for probabilistic concurrent systems
- Giacalone, Jou et al. - 1990
67
The complexity of probabilistic verification (context) - Courcoubetis, Yannakakis - 1988
56
Approximate symbolic model checking of continuous-time marko..
- Baier, Katoen et al. - 1999
55
Testing preorders for probabilistic processes (context) - Smolka, Cleaveland et al. - 1999
55
Testing preorders for probabilistic processes (context) - Cleaveland, Smolka et al. - 1992
52
Information and Control (context) - Rabin - 1963
52
Specification and refinement of probabilistic processes (context) - Jonsson, Larsen - 1991
51
Compositional testing preorders for probabilistic processes
- Jonsson, Yi - 1995
50
Bisimulation for labelled markov processes
- Blute, Desharnais et al. - 1997
50
Bisimulation for labelled markov processes
- Desharnais, Edalat et al.
49
It usually works: the temporal logic of stochastic systems
- Aziz, Singhal et al. - 1995
44
Composition and behaviors of probabilistic I/O-Automata
- Wu, Smolka et al. - 1997
36
Verification of multiprocess probabilistic protocols (context) - Pnueli, Zuck - 1986
36
Higher-level synchronising devices in MEIJE-SCCS (context) - de Simone - 1985
36
Simulations between specifications of distributed systems (context) - Jonsson - 1991
36
Weak bisimulation for fully probabilistic processes
- Baier, Hermanns - 1997
35
Observation equivalence as a testing equivalence (context) - Abramsky - 1987
34
Testing probabilistic and nondeterministic processes (context) - Yi, Larsen - 1992
32
Compositional verification of probabilistic processes (context) - Larsen, Skou - 1992
28
On algorithmic verification methods for probabilistic system.. (context) - Baier - 1999
27
A logical characterization of bisimulation for labeled marko..
- Desharnais, Edalat et al. - 1998
27
A logical characterization of bisimulation for labeled marko..
- Desharnais, Edalat et al. - 1998
24
Testing equivalences and fully abstract models for probabili.. (context) - Christoff - 1990
23
and stratified models of probabilistic processes (context) - van Glabbeek, Smolka et al. - 1990
19
Formal Verification of Probabilistic Systems (context) - de Alfaro - 1997
19
Polynomial time algorithms for testing probabilistic bisimul..
- Baier - 1996
19
A compositional trace-based semantics for probabilistic auto.. (context) - Segala - 1995
12
Time and Probabilities in Formal Design of Distributed Syste.. (context) - Hansson - 1994
12
On generative parallel composition
- D'Argenio, Hermanns et al. - 1998
10
An algebraic approach to the specification of stochastic sys..
- d'Arginio, Katoen et al. - 1998
8
Efficient algorithms for verification of equivalences for pr.. (context) - Christoff, Christoff - 1991
7
Reasoning about probabilistic behavior in concurrent systems (context) - Purushothaman, Subrahmanyam - 1989
5
General purpose discrete-event simulation using SPADES
- D'Argenio, Katoen et al. - 1998
5
Reasoning about safety and liveness properties for probabili.. (context) - Christoff, Christoff - 1992
4
Probabilistic temporal logics via the modal mu-calculus
- Narasimha, Cleaveland et al. - 1999
3
A polynomial-time algorithm for the equivalence of probabili.. (context) - Tzeng - 1992
2
Testing preorders for probabilistic processes can be charact..
- Jonsson, Yi - 2000
2
Interactive Markov Chains (context) - Hermans - 1998
1
Temporal logics for the specificaiton of performance and rel.. (context) - de Alfaro - 1997
1
Lecture Notes in Computer Science (context) - Desharnais, Gupta et al. - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.brics.dk/~varacca): More
The Powerdomain of Indexed Valuations - Daniele Varacca Brics (2002)
(Correct)
Probabilistic Event Structures and Domains Daniele Varacca - And Glynn Winskel
(Correct)
Probabilistic Petri Nets and Mazurkiewicz - Equivalence Daniele Varacca
(Correct)
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