K. Larsen and A. Skou. Compositional verification of probabilistic processes. In CONCUR'92, LNCS, 630:456--471, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....for (reactive) probabilistic transition systems (PTS) as studied by Larsen and Skou [LS91] who also introduced the corresponding notion of a probabilistic bisimulation. These systems were studied from a coalgebraic point of view e.g. by de Vink and Rutten [dVR99] and Moss [Mos99] Larsen and Skou [LS92] furthermore defined a set of basic operators to construct (finite) probabilistic transition systems and stated that probabilistic bisimulation is a congruence for them. A similar set of operators, but this time including recursion, was considered by van Glabbeek, Smolka, and Ste#en [vGSS95] The ....

Kim G. Larsen and Arne Skou. Compositional verification of probabilistic processes. In W. R. Cleaveland, editor, CONCUR '92: Third International Conference on Concurrency Theory, volume 630 of Lecture Notes in Computer Science, pages 456--471, Stony Brook, New York, 1992. Springer-Verlag.

....formats from the abstract framework, namely for timed systems. We used (reactive) probabilistic transition systems as studied by Larsen and Skou [LS91] or van Glabbeek, Smolka, and Ste#en [vGSS95] The coalgebraic definition we adopted was given by de Vink and Rutten [dVR99] Larsen and Skou [LS92] furthermore defined a set of basic operators to construct (finite) probabilistic transition systems and stated that their bisimulation is a congruence for them. A similar set of operators, but this time including recursion, was considered by van Glabbeek et al. vGSS95] who studied our reactive ....

Kim G. Larsen and Arne Skou. Compositional verification of probabilistic processes. In W. R. Cleaveland, editor, CONCUR '92: Third International Conference on Concurrency Theory, volume 630 of Lecture Notes in Computer Science, pages 456--471, Stony Brook, New York, 1992. Springer-Verlag.

.... Performance Evaluation Process Algebra (PEPA) originally introduced by Hillston [9] Stochastic process algebras arise through enhancing specification languages such as CCS [15] to include stochastic behaviour in the form of exponential timing, e.g. 3, 2, 8, 9] and probabilistic behaviour, e.g. [5, 14]. This is achieved by allowing basic actions (which are instantaneous in the classical process calculi) to have duration (exponentially distributed random variable) and replacing nondeterminism by a form of probabilistic choice. Starting with the standard operational semantics for PEPA, given in ....

....with the classical process algebra work are likely to be made easier, opening up the possibility for the transfer of existing methodologies such as verification and logics. Recent research in the area has focussed mainly on the operational side, see e.g. 3, 2, 8, 9] for stochastic and [5, 14] for probabilistic behaviour. Some effort has been put into building fully abstract denotational semantics for (pure) probabilistic process algebras, of which we mention a full abstraction result for may testing [11] where the model is rather involved and no recursion is considered; a ....

K.G. Larsen and A. Skou. Compositional verification of probabilistic processes, Proc. CONCUR'92, LNCS, 630:456-471, Springer, 1992.

.... Another well studied non interleaving qualitative aspect concerns the description of the localities where processes are placed (among the other proposals, see [8,1,2,29] Quantitative descriptions include transition systems that express temporal aspects [22,30,19,21,16] probabilistic aspects [34,25], and stochastic ones [20,23,3,9,31] Besides its interest in se, an SOS semantics for causality is relevant because it is paradigmatic for others qualitative, non interleaving description of concurrent systems, as well as for some of the quantitative ones. In particular, many non interleaving ....

K.G. Larsen and A. Skou. Compositional verification of probabilistic processes. In Proceedings of CONCUR'92, volume 630 of LNCS. Springer-Verlag, 1992.

....the reactive and limited generative models, and between the limited generative and generative models. We are also interested in the verification of properties for processes in our probabilistic process algebra, using HML extended with probabilities. This logic would be similar to that presented in [LS92]. ....

K.G. Larsen and A. Skou. Compositional verification of probabilistic processes. In CONCUR'92, LNCS 630, pages 456--471, 1992.

....methodologies such as verification and logics. Recent research in the area has focussed mainly on the operational side, enhancing process algebras such as CCS [14] and CSP [9] to include stochastic behaviour in the form of exponential timing, e.g. 2, 5, 8] and probabilistic behaviour, e.g. [6, 13]. This is achieved by allowing basic actions (instantaneous in the classical process calculi) to have duration (exponentially distributed random variable) and replacing nondeterminism by a form of probabilistic choice. There has been some effort into building fully abstract denotational semantics ....

K.G.Larsen and A.Skou. Compositional verification of probabilistic processes, Proc. Concur'92, LNCS, 630, Springer, 1992.

....a parallel operator with one probability (as in [Cua93] or the one with two probabilities described in [BBS92] We are also very interested in the verification of properties for processes in our language, using HML extended with probabilities. A good starting point is the logic described in [LS92]. Finally, we will extend the complete axiomatization given in [Cua93] to our semantic model. Acknowledgements We would like to thank Scott A. Smolka for his very useful comments on a draft version of this paper and for his warm reception when the first author visited Stony Brook. We are also ....

K.G. Larsen and A. Skou. Compositional verification of probabilistic processes. In CONCUR'92, LNCS 630, pages 456--471, 1992.

....models, completing a hierarchy of probabilistic models. We also would like to define the adequate extensions of HML [HM85] characterizing our different semantics, and apply them to the verification of properties of probabilistic processes. These logics should be similar to that presented in [LS92] Acknowledgements The authors would like to thank the anonymous referees of this paper for their valuable comments. ....

K.G. Larsen and A. Skou. Compositional verification of probabilistic processes. In CONCUR'92, LNCS 630, pages 456--471, 1992.

....case, while we must add new axioms in order to cope with the specific problems introduced by probabilities. There have been previous proposals for probabilistic axiom systems. For example, using Synchronous PCCS and generative probabilities [9, 13, 21] or with reactive probabilities [15]. An axiomatization for a subset of PCCS is presented in [20] and in [1] an axiomatization for ACP finite processes is given. These two proposals also use generative probabilities. Nevertheless, there exists an important difference between all these previous axiomatizations and ours: all of them ....

K.G. Larsen and A. Skou. Compositional verification of probabilistic processes. In CONCUR'92, LNCS 630, pages 456--471. Springer, 1992.

....proposed in the literature, but only a minority of them is applicable for PLCSs. Most of the algorithmic methods are formulated for finite Markov chains and hence are not applicable for PLCSs, see e.g. VW86,CY88,CC91,CC92,HT92,HJ94,CY95,IN96,BH97] Even some of the axiomatic methods, see e.g. [HS86,JS90,LS92], fail for PLCSs since they are designed for bounded (or even finite) Markov chains. 3 2 To overcome the limitations of algorithmic verification methods for LCSs due to undecidability results, ABJ98] propose (possibly non terminating) symbolic verification techniques based on a on the fly ....

K. Larsen and A. Skou. Compositional verification of probabilistic processes. In CONCUR'92, LNCS, 630:456--471, 1992.

.... predicates are used to express matters like (un)successful termination, convergence, divergence [3] enabledness [14] maximal delay, and side conditions [42] Negative premises are used to describe, e.g. deadlock detection [38] sequencing [17] priorities [7, 21] probabilistic behaviour [39], urgency [19] and various real [37] and discrete time [6, 35] settings. Since predicates and negative premises are so pervasive, and often lead to cleaner semantic descriptions for many features and constructs of interest, we deal explicitly with these notions. The organization of this column ....

K. G. Larsen and A. Skou, Compositional verification of probabilistic processes, in Cleaveland [20], pp. 456--471.

....the model used for performance evaluation guarantees the correspondence between the system and the performance model by construction. In the literature there have been many attempts to extend models of concurrency with quantitative information (e.g. temporal [31] or probabilistic extensions [37, 20, 25]) but the most promising approach is the one based on stochastic extensions. The first results appeared in the field of Petri nets with their stochastic extensions [35, 29, 2, 17, 26] Only in the last years stochastic extensions of process algebras [18, 23, 4, 10] have been considered to ....

K.G. Larsen and A. Skou. Compositional verification of probabilistic processes. In Proceedings of CONCUR'92, volume 630 of LNCS. Springer-Verlag, 1992.

....Our result can be seen as complementing the framework of Larsen Skou who (without considering a calculus) give a logical characterization of probabilistic bisimulation in terms of probabilistic modal logic. Existing research in this area has focussed mainly on the operational side, see e. g [2, 4, 6, 10, 12, 15, 19, 21]. In [2, 12, 15, 19] complete axiomatizations of the constructed probabilistic process calculi are given, with [15] dealing with a reactive model and [2, 12] generative models in the terminology of [20] The probabilistic powerdomain construction [9] has been applied to give domain theoretic ....

....the framework of Larsen Skou who (without considering a calculus) give a logical characterization of probabilistic bisimulation in terms of probabilistic modal logic. Existing research in this area has focussed mainly on the operational side, see e. g [2, 4, 6, 10, 12, 15, 19, 21] In [2, 12, 15, 19] complete axiomatizations of the constructed probabilistic process calculi are given, with [15] dealing with a reactive model and [2, 12] generative models in the terminology of [20] The probabilistic powerdomain construction [9] has been applied to give domain theoretic semantics to certain ....

[Article contains additional citation context not shown here]

K.G.Larsen and A.Skou. Compositional verification of probabilistic processes, Proc. Concur'92, LNCS, 630, Springer, 1992.

.... Performance Evaluation Process Algebra (PEPA) originally introduced by Hillston [9] Stochastic process algebras arise through enhancing specification languages such as CCS [15] to include stochastic behaviour in the form of exponential timing, e.g. 3, 2, 8, 9] and probabilistic behaviour, e.g. [5, 14]. This is achieved by allowing basic actions (which are instantaneous in the classical process calculi) to have duration (exponentially distributed random variable) and replacing nondeterminism by a form of probabilistic choice. Starting with the standard operational semantics for PEPA, given in ....

....comparisons with the classical process algebra work are likely to be made easier, opening up the possibility for the transfer of existing methodologies such as verification and logics. Recent research in the area has focussed mainly on the operational side, see e.g. 3, 2, 8, 9] for stochastic and [5, 14] for probabilistic behaviour. Some effort has been put into building fully abstract denotational semantics for (pure) probabilistic process algebras, of which we mention a full abstraction result for may testing [11] where the model is rather involved and no recursion is considered; a ....

K.G. Larsen and A. Skou. Compositional verification of probabilistic processes, Proc. CONCUR'92, LNCS, 630:456-471, Springer, 1992.

....describing such decorated rules. Another phenomenon that we see in the literature is the use of negative premises in rules defining the operational semantics. We can find negative premises to operationally describe deadlock detection [18] sequencing [8] priorities [4] probabilistic behaviour [19], urgency [10] and various real [17] and discrete time [2] settings. Now it will not be very surprising that there are also hybrid rules using both decorations and negative premises (we will treat some of them in the applications) This is where the panth format comes into play, since these ....

K. G. Larsen, A. Skou, Compositional Verification of Probabilistic Processes, in: W. R. Cleaveland, editor, Proceedings CONCUR 92, Stony Brook, LNCS 630, pp. 456--471, Springer-Verlag, 1992.

....combinators can be used to compose specifications from simple ones. Thus, we can specify and analyze a complex system in terms of the specifications of its components. To reason about probabilistic processes, several probabilistic process calculi have been developed [C90] GSST90] HJ90] JS90] [LS91] [BBS92] L93] by extending traditional process calculi like CCS and CSP with a stochastic choice operator P ffi [p i ]E i . Intuitively, P ffi [p i ]E i describes a process that may become E i with probability p i . This requires that the probability distribution on the choices E i s is ....

....terms of the simulations and associated equivalences, including an expansion theorem for parallel composition. They provide a complete axiomatization for the induced congruence by . Over the past few years, a number of probabilistic models have been developed, e.g. C90] GSST90] HJ90] JS90] [LS91] [BBS92] L93] As said earlier, all these work assume that the probability for a probabilistic transition is completely known. In [JL91] Larsen and Jonsson proposed a different model named probabilistic specification system, which allows intervals (more generally sets) of probabilities. But they ....

K. G. Larsen and A. Skou, Compositional Verification of Probabilistic Processes, in the proc. of CONCUR92, LNCS 630, 1992.

.... For S a process algebraic specification the model construction problem for (1) is a real time extension of the equation solving problem studied in [LX90b, Shi, Par89, LQ90] For S a logical specification our work is related to and extends the work on contexts as property transformers studied in [LX91, LS92]. Our method assumes that the network components A 1 : A n and X are all regular timed agents [Wan90] or equivalently one clock timed automata [AD90] For reasons of clarity we have chosen to present our solution method in a somewhat simplified setting: The notion of parallel composition ....

K.G. Larsen and A. Skou. Compositional verification of probabilistic processes. In Proceedings of CONCUR'92. To appear in Lecture Notes in Computer Science., 1992.

....has been shown to be completely captured by inclusion between the sets of logical properties satisfied by states (see also Bradfield and Stirling, Chapter 1. 4 in this issue) Bisimilarity between non probabilistic transition systems is characterized by the so called Hennessy Milner Logic [33] In [40 42], this characterization has been extended to probabilistic bisimulation for reactive probabilistic systems by identification of a suitable probabilistic extension of Hennessy Milner Logic. In [9, 25, 26] a further generalization to nondiscrete probabilistic systems (Labelled Markov Processes) is ....

....Hennessy Milner Logic. In [9, 25, 26] a further generalization to nondiscrete probabilistic systems (Labelled Markov Processes) is given, and in particular it is shown that probabilistic bisimulation can be characterized by a very weak, negation free modal logic. In addition, and in contrast to [40 42], the characterization offered by [9, 25, 26] requires no finite branching assumptions. Here, we adapt the probabilistic modal logic, PML, of [40 42] to the probabilistic model studied in this paper. As for states, the formulas of the logic come in two flavours: non deterministic formulas ....

[Article contains additional citation context not shown here]

K.G. Larsen and A. Skou. Compositional verification of probabilistic processes. In Cleaveland, editor, Proc. CONCUR '92, Theories of Concurrency: Unification and Extension, volume 630 of Lecture Notes in Computer Science. Springer Verlag, 1992.

No context found.

K. Larsen and A. Skou. Compositional verification of probabilistic processes. In CONCUR'92, LNCS, 630:456--471, 1992.

No context found.

K. G. Larsen, A. Skou. Compositional verification of probabilistic processes. Proc. CONCUR, LNCS 630:456--471, 1992.

No context found.

K.G. Larsen and A. Skou, Compositional verification of probabilistic processes, CONCUR '92, Third International Conference on Concurrency Theory, Stony Brook, NY, USA (R. Cleaveland, ed.), LNCS, vol. 630, SpringerVerlag, 1992, pp. 456--471.

No context found.

A. Skou K. Larsen. Compositional verification of probabilistic processes. In W.R. Cleaveland, editor, Proceedings CONCUR 92, Stony Brook, NY, USA, volume 630 of Lecture Notes in Computer Science, pages 456--471. SpringerVerlag, 1992.

No context found.

Kim G. Larsen and Arne Skou. Compositional verification of probabilistic processes. In W. R. Cleaveland, editor, CONCUR '92: Third International Conference on Concurrency Theory, volume 630 of Lecture Notes in Computer Science, pages 456--471. Springer Verlag, 1992.

No context found.

A. Skou K. Larsen. Compositional verification of probabilistic processes. In W.R. Cleaveland, editor, Proceedings CONCUR 92, Stony Brook, NY, USA, volume 630 of Lecture Notes in Computer Science, pages 456--471. SpringerVerlag, 1992.

No context found.

K.G. Larsen and A. Skou. Compositional verification of probabilistic processes. In W.R. Cleaveland, editor, CONCUR'92: Concurrency Theory. 3rd Int. Conf., volume 630 of Lect. Notes in Comp. Sci. Springer-Verlag, 1992.

First 50 documents

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