Results 1 
4 of
4
A Hybrid Linear Logic for Constrained Transition Systems
, 2009
"... Linear implication can represent state transitions, but real transition systems operate under temporal, stochastic or probabilistic constraints that are not directly representable in ordinary linear logic. We propose a general modal extension of intuitionistic linear logic where logical truth is ind ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Linear implication can represent state transitions, but real transition systems operate under temporal, stochastic or probabilistic constraints that are not directly representable in ordinary linear logic. We propose a general modal extension of intuitionistic linear logic where logical truth is indexed by constraints and hybrid connectives combine constraint reasoning with logical reasoning. The logic has a focused cutfree sequent calculus that can be used to internalize the rules of particular constrained transition systems; we illustrate this with an adequate encoding of the synchronous stochastic picalculus. We also present some preliminary experiments of direct encoding of biological systems in the logic. 1
Model checking the probabilistic πcalculus
 In Proceedings of QEST. IEEE Computer Society
, 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. Formal verification techniques for this calculus have clear applications in several domains, including mobile ad ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We present an implementation of model checking for the probabilistic πcalculus, a process algebra which supports modelling of concurrency, mobility and discrete probabilistic behaviour. Formal verification techniques for this calculus have clear applications in several domains, including mobile adhoc network protocols and random security protocols. Despite this, no implementation of automated verification exists. Building upon the (nonprobabilistic) πcalculus model checker MMC, we first show an automated procedure for constructing the Markov decision process representing a probabilistic πcalculus process. This can then be verified using existing probabilistic model checkers such as PRISM. Secondly, we demonstrate how for a large class of systems a more efficient, compositional approach can be applied, which uses our extension of MMC on each parallel component of the system and then translates the results into a highlevel model description for the PRISM tool. The feasibility of our techniques is demonstrated through three case studies from the πcalculus literature. 1.
A Local Algorithm for Checking Probabilistic Bisimilarity
"... Abstract—Bisimilarity is one of the most important relations for comparing the behaviour of formal systems in concurrency theory. Decision algorithms for bisimilarity in finite state systems are usually classified into two kinds: global algorithms are generally efficient but require to generate the ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract—Bisimilarity is one of the most important relations for comparing the behaviour of formal systems in concurrency theory. Decision algorithms for bisimilarity in finite state systems are usually classified into two kinds: global algorithms are generally efficient but require to generate the whole state spaces in advance, and local algorithms combine the verification of a system’s behaviour with the generation of the system’s state space, which is often more effective to determine that one system fails to be related to another. Although local algorithms are well established in the classical concurrency theory, the study of local algorithms in probabilistic concurrency theory is not mature. In this paper we propose a polynomial time local algorithm for checking probabilistic bisimilarity. With mild modification, the algorithm can be easily adapted to decide probabilistic similarity with the same time complexity. Keywordsconcurrency; probabilistic bisimilarity; local algorithm; probabilistic labelled transition systems; I.
THEME Programs, Verification and ProofsTable of contents
"... 3.2. The probabilistic asynchronous πcalculus 2 ..."