Filters








90,747 Hits in 5.7 sec

Analysis of Probabilistic Basic Parallel Processes [article]

Rémi Bonnet and Stefan Kiefer and Anthony W. Lin
2014 arXiv   pre-print
Basic Parallel Processes (BPPs) are a well-known subclass of Petri Nets. They are the simplest common model of concurrent programs that allows unbounded spawning of processes.  ...  In the probabilistic version of BPPs, every process generates other processes according to a probability distribution.  ...  Introduction We study probabilistic basic parallel processes (pBPP), which is a stochastic model for concurrent systems with unbounded process spawning.  ... 
arXiv:1401.4130v1 fatcat:b4myall445aiffupcgf7nxlxdq

Analysis of Probabilistic Basic Parallel Processes [chapter]

Rémi Bonnet, Stefan Kiefer, Anthony Widjaja Lin
2014 Lecture Notes in Computer Science  
Basic Parallel Processes (BPPs) are a well-known subclass of Petri Nets. They are the simplest common model of concurrent programs that allows unbounded spawning of processes.  ...  In the probabilistic version of BPPs, every process generates other processes according to a probability distribution.  ...  Introduction We study probabilistic basic parallel processes (pBPP), which is a stochastic model for concurrent systems with unbounded process spawning.  ... 
doi:10.1007/978-3-642-54830-7_3 fatcat:zowsw3s5h5e4tkabug7sgkwuoi

Topology, randomness and noise in process calculus

Mingsheng Ying
2007 Frontiers of Electrical and Electronic Engineering in China  
In the previous works, the author systematically studied topology in process calculus, probabilistic process calculus and pi-calculus with noisy channels in order to describe approximate behaviors of communicating  ...  Formal models of communicating and concurrent systems are one of the most important topics in formal methods, and process calculus is one of the most successful formal models of communicating and concurrent  ...  To One of the key problems in probabilistic CCS is the randomization of parallel composition.  ... 
doi:10.1007/s11460-007-0024-9 fatcat:5xtyqovgb5ayndi2b45zd2iesi

Time and Probability in Process Algebra [chapter]

Suzana Andova
2000 Lecture Notes in Computer Science  
In the paper we present an ACP-like process algebra which can be used to model both probabilistic and time behaviour of parallel systems.  ...  This process algebra is obtained by extension of untimed probabilistic process algebra with constructors that allow the explicit specification of timing aspects.  ...  Doing so, we obtain the Probabilistic basic process algebra with delayable actions. Next we introduce parallel composition and communication.  ... 
doi:10.1007/3-540-45499-3_24 fatcat:mnk3kflmefac7peilyk6am327m

Model checking the probabilistic pi-calculus

Gethin Norman, Catuscia Palamidessi, David Parker, Peng Wu
2007 Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)  
We present an implementation of model checking for the probabilistic π-calculus, a process algebra which supports modelling of concurrency, mobility and discrete probabilistic behaviour.  ...  Building upon the (non-probabilistic) π-calculus model checker MMC, we first show an automated procedure for constructing the Markov decision process representing a probabilistic πcalculus process.  ...  ProVerif [2] supports verification of the applied π-calculus, a variant of the basic calculus. It is aimed primarily at analysis of cryptographic protocols and is theorem-prover based.  ... 
doi:10.1109/qest.2007.31 dblp:conf/qest/NormanPPW07 fatcat:fnxykmrjtbbhlmfot5csjvchg4

Probabilistic Linda-Based Coordination Languages [chapter]

Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky
2005 Lecture Notes in Computer Science  
The main objective of such a study is to develop a semantic basis for a quantitative analysis of systems of interconnected or interacting components, which allows us to address not only the functional  ...  Coordination refers to the ways the independent active pieces of a program (e.g. a process, a task, a thread, etc.) communicate and synchronise with each other.  ...  Work in performance analysis is often based on probabilistic process calculi, for example, on Hillston's PEPA [33] , or EMPA by Bernardo and Gorrieri [34] .  ... 
doi:10.1007/11561163_6 fatcat:paq4lukxxrchhjwyqxa62pe7e4

Probabilistic Self-Stabilization [article]

Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale
2015 arXiv   pre-print
By using concrete scenarios, we present and discuss a new concept of probabilistic Self-Stabilization in Distributed Systems.  ...  In a basic variant, each of the agents initially supports an opinion (say a value chosen from a fixed set K of legal values).  ...  These two facts easily imply an upper bound O`n 2 log 2 n˘for the parallel cover time of the repeated balls-into-bins process on the complete graph.  ... 
arXiv:1507.06707v1 fatcat:r6n4uv5h4zc2ne7ym2wyqgcany

Input/Output Automata: Basic, Timed, Hybrid, Probabilistic, Dynamic,.. [chapter]

Nancy Lynch
2003 Lecture Notes in Computer Science  
Finally, "dynamic I/O automata" were introduced recently by Attie; they add, to the basic "unfair" model, the capability for processes to create other processes and to destroy themselves.  ...  "Probabilistic I/O automata", defined by Segala in 1995, allow probabilistic choice of the next state, in addition to nondeterministic choice.  ...  In fact, eventually, we would like to have a comprehensive I/O-automata-style modeling framework that can express all of the features described above -fairness, time, continuous behavior, probabilistic  ... 
doi:10.1007/978-3-540-45187-7_12 fatcat:k3quuw3clfhnrgbdiakcatdjfy

Numerical Analysis for Problems of Remote Sensing with Random Input Data

Boris Dobronets, Olga Popova, G.M. Tsibulsky, M.V. Noskov, E.A. Lupyan, L.G. Sverdlik, A.K. Sagatelian, V.I. Kharuk, V.B. Kashkin
2019 E3S Web of Conferences  
To calculate a function with random arguments we apply one of the basic concepts of numerical probabilistic analysis as the probabilistic extension.  ...  In this article we propose a new approach to calculation of functions with random arguments, which is a technique of fast computations, based on the idea of parallel computations and the application of  ...  In general, it is NP-hard problem with actual parallelization. In Figure 1 shows the tree of parallel recursive organization of the computational process.  ... 
doi:10.1051/e3sconf/20197501004 fatcat:b6ev3rwgszdtbhx5mohyjbr44y

An Algebraic Approach to the Specification of Stochastic Systems (Extended Abstract) [chapter]

P. R. D'Argenio, J.-P. Katoen, E. Brinksma
1998 Programming Concepts and Methods PROCOMET '98  
Therefore, we introduce a type of probabilistic transition system that can deal with arbitrary probability spaces.  ...  In order to give semantics to Q, we also introduce a model that is an extension of traditional automata with clocks which are basically random variables: the stochastic automata model.  ...  In fact, it turns out that probabilistic bisimilarity is not a congruence for some basic operations on stochastic automata, such as parallel composition.  ... 
doi:10.1007/978-0-387-35358-6_12 fatcat:4ja4xoihhjfu3lqg4aeszfrdy4

The application of a compound model for predicting relaibility indices of engineering systems

Ona Lukoševičienė, Antanas Kudzys
2016 Mechanics  
and Other Researchers and the Promotion of Student Research (VP1-3.1-ŠMM-01) of the Program of Human Resources Development Action Plan.  ...  Postdoctoral fellowship is being funded by European Union Structural Funds project "Postdoctoral Fellowship Implementation in Lithuania" within the framework of the Measure for Enhancing Mobility of Scholars  ...  However, the probabilistic analysis of the systems involves the integration of multivariate and multistate distributions.  ... 
doi:10.5755/j01.mech.22.2.12268 fatcat:qnwk23iikbefrmrrzjtexs6jn4

A Probabilistic Strategy for Setting Temporal Constraints in Scientific Workflows [chapter]

Xiao Liu, Jinjun Chen, Yun Yang
2008 Lecture Notes in Computer Science  
In this paper, with a systematic analysis of such problem, we propose a probabilistic strategy which is capable of setting coarse-grained and finegrained temporal constraints based on the weighted joint  ...  distribution of activity durations.  ...  of parallelism and iteration for data updating and pre-processing (activities , , X X X ).  ... 
doi:10.1007/978-3-540-85758-7_15 fatcat:uopk7pjgdfglxlrq5jagrtdeiu

Local Quantitative LTL Model Checking [chapter]

Jiří Barnat, Luboš Brim, Ivana Černá, Milan Češka, Jana Tůmová
2009 Lecture Notes in Computer Science  
Quantitative analysis of probabilistic systems has been studied mainly from the global model checking point of view.  ...  In the global model-checking, the goal of verification is to decide the probability of satisfaction of a given property for all reachable states in the state space of the system under investigation.  ...  Figure 6 aims on the qualitative analysis as a part of the whole verification process.  ... 
doi:10.1007/978-3-642-03240-0_8 fatcat:i5nlqnzuybfftdsjfe6giadmli

Instruction sequence notations with probabilistic instructions [article]

J. A. Bergstra, C. A. Middelburg
2014 arXiv   pre-print
We propose several kinds of probabilistic instructions, provide an informal operational meaning for each of them, and discuss related work.  ...  We also discuss the approach of projection semantics, which was introduced in earlier work on instruction sequences, in the light of probabilistic instruction sequences.  ...  The first probabilistic process algebra is presented in [23] and the first probabilistic process algebra with an asynchronous parallel composition operator is presented in [5] .  ... 
arXiv:0906.3083v2 fatcat:bsfhmph2bvhz3b4axci2dsn75q

Computational aspects of probabilistic extensions
Вычислительные аспекты вероятностных расширений

Boris S. Dobronets, Siberian Federal University, Krasnoyarsk, Russian Federation, Olga A. Popova
2019 Vestnik Tomskogo gosudarstvennogo universiteta Upravlenie vychislitel naya tekhnika i informatika  
We apply one of the basic concepts of numerical probabilistic analysis as the probabilistic extension to computing a function with random arguments.  ...  Approach based on the idea of dimension reduction by to calculating some integrals and the application of numerical probability analysis.  ...  A major non-Monte Carlo approach is interval analysis. However, interval analysis computing only to the boundaries of random processes, without examining their internal distributions.  ... 
doi:10.17223/19988605/47/5 fatcat:oerjryjf2rfzljyq5fq5gxdq4a
« Previous Showing results 1 — 15 out of 90,747 results