Results 11  20
of
63
Axiomatization of trace semantics for stochastic nondeterministic processes. Quantitative Evaluation of Systems
 In Proceedings of QEST
, 2004
"... We give a complete axiomatization of trace distribution precongruence for probabilistic nondeterministic processes based on a process algebra that includes internal behavior and recursion. The axiomatization is given for two different semantics of the process algebra that are consistent with the alt ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
We give a complete axiomatization of trace distribution precongruence for probabilistic nondeterministic processes based on a process algebra that includes internal behavior and recursion. The axiomatization is given for two different semantics of the process algebra that are consistent
The Theory of Interactive Generalized SemiMarkov Processes
 Theoretical Computer Science
, 2000
"... In this paper we introduce the calculus of Interactive Generalized SemiMarkov Processes (IGSMPs), a stochastic process algebra which can express probabilistic timed delays with general distributions and synchronizable actions with zero duration, and where choices may be probabilistic, nondetermini ..."
Abstract

Cited by 36 (7 self)
 Add to MetaCart
In this paper we introduce the calculus of Interactive Generalized SemiMarkov Processes (IGSMPs), a stochastic process algebra which can express probabilistic timed delays with general distributions and synchronizable actions with zero duration, and where choices may be probabilistic, nondeterministic
Security Analysis of a Probabilistic Nonrepudiation Protocol
 Proc. of PAPMPROBMIV ’02, LNCS 2399
, 2002
"... Abstract. Noninterference is a definition of security introduced for the analysis of confidential information flow in computer systems. In this paper, a probabilistic notion of noninterference is used to reveal information leakage which derives from the probabilistic behavior of systems. In partic ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
. In particular, as a case study, we model and analyze a nonrepudiation protocol which employs a probabilistic algorithm to achieve a fairness property. The analysis, conducted by resorting to a definition of probabilistic noninterference in the context of process algebras, confirms that a solely
Towards the Integration of RealTime and ProbabilisticTime Process Algebras
 in Proc. of the 3rd European Research Seminar on Advances in Distributed Systems (ERSADS '99), Madeira Island
, 1999
"... A formal approach for the design and analysis of concurrent systems is proposed which integrates two different orthogonal aspects of time: the aspect of realtime, concerning the expression of time constraints and the verification of exact time properties, and the aspect of probabilistictime, conce ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
time, concerning the probabilistic quantification of nondeterministic durations and the evaluation of system performance. We show that these two aspects (that led to the introduction of different specification languages called realtime and stochastic process algebras) can be expressed by a single language
Semantics of Probabilistic Processes An Operational Approach
"... Subject matter With the rapid development of computer network and communication technology, the study of concurrent and distributed systems has become increasingly important. Among various models of concurrent computation, process calculi have been widely investigated and successfully used in the s ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
of Probabilistic Processes ” [4] we adopt an operational approach to describing the behaviour of nondeterministic and probabilistic processes. The semantic comparison of different systems is based on appropriate behavioural relations such as bisimulation equivalences and testing preorders. This book mainly
Probabilistic PolynomialTime Process Calculus and Security Protocol Analysis
 Theoretical Computer Science
, 2006
"... Abstract. We prove properties of a process calculus that is designed for analysing security protocols. Our longterm goal is to develop a form of protocol analysis, consistent with standard cryptographic assumptions, that provides a language for expressing probabilistic polynomialtime protocol step ..."
Abstract

Cited by 38 (3 self)
 Add to MetaCart
between security and nondeterminism, messages are scheduled probabilistically instead of nondeterministically. We prove that evaluation of any process expression halts in probabilistic polynomial time and define a form of asymptotic protocol equivalence that allows security properties to be expressed
On the Origin of Space Part 19: Nondeterministic Solution of Satisfiability Problems
"... The consequences of an interpretation of quantum theory following the line of Everett’s manyrealities lead to the theoretical possibility of computers that could tractably solve satisfiability problems, and hence other NPcomplete problems widely considered to be intractable for classical computers ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
computers and presently considered probabilistic quantum computers. The extra capability is seen to come from the ability of composite quantum systems (CQS) to process noninterfering realities through quantum observers; probabilistic quantum computers can only process interfering realities by using
Representing Causal Information about a Probabilistic Process
"... Abstract. We study causal information about probabilistic processes, i.e., information about why events occur. A language is developed in which such information can be formally represented and we investigate when this suffices to uniquely characterize the probability distribution that results from s ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
Abstract. We study causal information about probabilistic processes, i.e., information about why events occur. A language is developed in which such information can be formally represented and we investigate when this suffices to uniquely characterize the probability distribution that results from
Testing Probabilistic Processes: Can Random Choices Be Unobservable?
, 907
"... Abstract. A central paradigm behind process semantics based on observability and testing is that the exact moment of occurring of an internal nondeterministic choice is unobservable. It is natural, therefore, for this property to hold when the internal choice is quantified with probabilities. Howeve ..."
Abstract
 Add to MetaCart
Abstract. A central paradigm behind process semantics based on observability and testing is that the exact moment of occurring of an internal nondeterministic choice is unobservable. It is natural, therefore, for this property to hold when the internal choice is quantified with probabilities
A probabilistic polynomialtime calculus for analysis of cryptographic protocols
 Electronic Notes in Theoretical Computer Science
, 2001
"... We prove properties of a process calculus that is designed for analyzing security protocols. Our longterm goal is to develop a form of protocol analysis, consistent with standard cryptographic assumptions, that provides a language for expressing probabilistic polynomialtime protocol steps, a spec ..."
Abstract

Cited by 48 (8 self)
 Add to MetaCart
and nondeterminism, messages are scheduled probabilistically instead of nondeterministically. We prove that evaluation of any process expression halts in probabilistic polynomial time and define a form of asymptotic protocol equivalence that allows security properties to be expressed using observational equivalence
Results 11  20
of
63