Download:
|
by Insup Lee, Rance Cleaveland, Scott Smolka
http://www.cis.upenn.edu/~lee/tmp/98probmiv.ps
Add To MetaCart
Abstract:
The paper presents PACSR, a probabilistic extension of a real-time process algebra ACSR. The extension is built upon a novel treatment of the notion of a resource. In ACSR, resources are used to model contention in accessing physical devices such as processors, memory modules, and communication links, or any other reusable resource of limited capacity. Here, we invest resources with an ability to fail and associate, with every resource, a probability of its failure. The resulting formalism allows us to perform probabilistic analysis of real-time system specifications in the presence of resource failures. An attractive feature of PACSR is the ability to express failurerecovery actions easily. We perform probabilistic reachability analysis for PACSR specifications that allows us to compute the probability of occurrence of an undesirable event. We illustrate PACSR specification and analysis by means of a telecommunications example. 1
Citations
|
2762
|
Communication and Concurrency
– Milner
- 1989
|
|
568
|
Design and synthesis of synchronization skeletons using branching time temporal logic
– Clarke, Emerson
- 1981
|
|
541
|
Concurrency and automata on infinite sequences
– Park
- 1981
|
|
247
|
Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications
– Clarke, Emerson, et al.
- 1986
|
|
185
|
Probabilistic simulations for probabilistic processes
– Segala, Lynch
|
|
172
|
A temporal calculus of communicating systems
– Moller, Tofts
- 1990
|
|
151
|
Modeling and verification of randomized distributed real-time systems
– Segala
- 1995
|
|
148
|
Model checking of probabilistic and nondeterministic systems
– Bianco, Alfaro
- 1995
|
|
144
|
Time and Probability in Formal Design of Distributed Systems
– Hansson
- 1994
|
|
140
|
Measure Theory
– Halmos
- 1974
|
|
101
|
A process algebra for timed systems
– Hennessy, Regan
- 1995
|
|
90
|
Algebraic reasoning for probabilistic concurrent systems
– Giacalone, Jou, et al.
- 1990
|
|
79
|
Three Logics of Branching Bisimulation
– Nicola, Vaandrager
- 1990
|
|
69
|
Axiomatizing probabilistic processes: ACP with generative probabilities
– Baeten, Bergstra, et al.
- 1995
|
|
65
|
A logic for reasoning about time and probability
– Hansson, Jonsson
- 1994
|
|
63
|
Symbolic model checking for probabilistic processes
– Baier, Clarke, et al.
- 1997
|
|
55
|
A process algebraic approach to the specification and analysis of resource-bound real-time systems
– Lee, Br'emond-Gr'egoire, et al.
- 1994
|
|
17
|
Olnhausen, Model-checking of realtime systems: a telecommunication application
– Alur, Jagadeesan, et al.
- 1997
|
|
15
|
Modeling systems by probabilistic process algebra: An event structures approach
– Katoen, Langerak, et al.
- 1994
|
|
15
|
A Complete Axiomatization for Observational Congruence of Finite-state Behaviours
– Milner
- 1989
|
|
8
|
PARAGON: A Paradigm for the Specification, Verification, and Testing of Real-Time Systems
– Ben-Abdallah, Clarke, et al.
- 1997
|
|
7
|
Automatic Verification of Liveness Properties of Randomized Systems (Extended Abstract
– Baier, Kwiatkowska
- 1997
|
|
5
|
A complete axiomatization of finite-state ACSR processes
– Br'emond-Gr'egoire, Choi, et al.
- 1997
|
