Results 1  10
of
20
Automatic Analysis of a NonRepudiation Protocol
 In Proc. of QAPL’03, Elsevier ENTCS
, 2004
"... We define a probabilistic model for the analysis of a NonRepudiation protocol that guarantees fairness, without resorting to a trusted third party, by means of a probabilistic algorithm. By using the PRISM model checker, we estimate the probability for a malicious user to break the nonrepudiation ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
(Show Context)
We define a probabilistic model for the analysis of a NonRepudiation protocol that guarantees fairness, without resorting to a trusted third party, by means of a probabilistic algorithm. By using the PRISM model checker, we estimate the probability for a malicious user to break the nonrepudiation property, depending on various parameters of the protocol.
An Extension of the Inverse Method to Probabilistic Timed Automata
, 2009
"... Probabilistic timed automata can be used to model systems in which probabilistic and timing behavior coexist. Verification of probabilistic timed automata models is generally performed with regard to a single reference valuation of the timing parameters. Given such a parameter valuation, we present ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
(Show Context)
Probabilistic timed automata can be used to model systems in which probabilistic and timing behavior coexist. Verification of probabilistic timed automata models is generally performed with regard to a single reference valuation of the timing parameters. Given such a parameter valuation, we present a method for obtaining automatically a constraint on timing parameters for which the reachability probabilities (1) remain invariant and (2) are equal to the reachability probabilities for the reference valuation. The method relies on parametric analysis of a nonprobabilistic version of the probabilistic timed automata model using the “inverse method”. Our approach is useful for avoiding repeated executions of probabilistic model checking analyses for the same model with different parameter valuations. We provide examples of the application of our technique to models of randomized protocols.
Decidability Results for Parametric Probabilistic Transition Systems with an Application to Security
 In Proc. of SEFM’04, IEEE
, 2004
"... We develop a model of Parametric Probabilistic Transition Systems. In this model probabilities associated with transitions may be parameters, and we show how to find instances of parameters that satisfy a given property and instances that either maximize or minimize the probability of reaching a giv ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
(Show Context)
We develop a model of Parametric Probabilistic Transition Systems. In this model probabilities associated with transitions may be parameters, and we show how to find instances of parameters that satisfy a given property and instances that either maximize or minimize the probability of reaching a given state. We show, as an application, the model of a probabilistic non repudiation protocol. The theory we develop, allows us to find instances that maximize the probability that the protocol ends in a fair state (no participant has an advantage over the others).
A Team Automaton Scenario for the Analysis of Security Properties of Communication Protocols
, 2006
"... Formal methods are a popular means to specify and verify security properties of a variety of communication protocols. In this article we take a step towards the use of team automata for the analysis of security aspects in such protocols. To this aim, we define an insecure communication scenario for ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Formal methods are a popular means to specify and verify security properties of a variety of communication protocols. In this article we take a step towards the use of team automata for the analysis of security aspects in such protocols. To this aim, we define an insecure communication scenario for team automata that is general enough to encompass various communication protocols. We then reformulate the Generalized NonDeducibility on Compositions schema—originally introduced in the context of process algebrae—in terms of team automata. Based on the resulting team automata framework, we subsequently develop two analysis strategies that can be used to verify security properties of communication protocols. Indeed, the paper concludes with two case studies in which we show how our framework can be used to prove integrity and secrecy in two different settings: We show how integrity is guaranteed in a team automaton model of a particular instance of the Efficient Multichained Stream Signature protocol, a communication protocol for signing digital streams that provides some robustness against packet loss, and we show how secrecy is preserved when a member of a multicast group leaves the group in a particular run of the complementary variable approach to the NRoot/Leaf pairwise keys protocol.
Team automata for security: A survey
 INTERNATIONAL WORKSHOP ON SECURITY ISSUES IN COORDINATION MODELS, LANGUAGES, AND SYSTEMS, VOLUME 128 OF ELECTR. NOTES IN THEOR. COMP. SCI
, 2005
"... In [30], Kleijn presented a survey of the use of team automata for the specification and analysis of phenomena from the field of computer supported cooperative work, in particular notions related to groupware systems. In this paper we present a survey of the use of team automata for the specificatio ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
In [30], Kleijn presented a survey of the use of team automata for the specification and analysis of phenomena from the field of computer supported cooperative work, in particular notions related to groupware systems. In this paper we present a survey of the use of team automata for the specification and analysis of some issues from the field of security.
Team Automata for Security Analysis
 Object Management Group (OMG
, 2004
"... We show that team automata (TA) are well suited for security analysis by reformulating the Generalized NonDeducibility on Compositions (GNDC) schema in terms of TA. We then use this to show that integrity is guaranteed for a case study in which TA model an instance of the Efficient Multichained Str ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
(Show Context)
We show that team automata (TA) are well suited for security analysis by reformulating the Generalized NonDeducibility on Compositions (GNDC) schema in terms of TA. We then use this to show that integrity is guaranteed for a case study in which TA model an instance of the Efficient Multichained Stream Signature (EMSS) protocol.
Symbolic Bisimulations for Probabilistic Systems
"... The paper introduces symbolic bisimulations for a simple probabilistic πcalculus to overcome the infinite branching problem that still exists in checking ground bisimulations between probabilistic systems. Especially the definition of weak (symbolic) bisimulation does not rely on the random capabil ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
The paper introduces symbolic bisimulations for a simple probabilistic πcalculus to overcome the infinite branching problem that still exists in checking ground bisimulations between probabilistic systems. Especially the definition of weak (symbolic) bisimulation does not rely on the random capability of adversaries and suggests a solution to the open problem on the axiomatization for weak bisimulation in the case of unguarded recursion. Furthermore, we present an efficient characterization of symbolic bisimulations for the calculus, which allows the ”onthefly ” instantiation of bound names and dynamic construction of equivalence relations for quantitative evaluation. This directly results in a local decision algorithm that can explore just a minimal portion of the state spaces of the probabilistic processes in question. 1
Timeabstracting bisimulation for probabilistic timed automata
 In Proc. TASE’08
, 2008
"... This paper focuses on probabilistic timed automata (PTA), an extension of timed automata with discrete probabilistic branchings. As the regions of these automata often lead to an exponential blowup, reduction techniques are of utmost importance. In this paper, we investigate probabilistic timeab ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
This paper focuses on probabilistic timed automata (PTA), an extension of timed automata with discrete probabilistic branchings. As the regions of these automata often lead to an exponential blowup, reduction techniques are of utmost importance. In this paper, we investigate probabilistic timeabstracting bisimulation (PTAB), an equivalence notion that abstracts from exact time delays. PTAB is proven to preserve probabilistic computational tree logic (PCTL). The region equivalence is a (very refined) PTAB. Furthermore, we provide a nontrivial adaptation of the traditional partitionrefinement algorithm to compute the quotient under PTAB. This algorithm is symbolic in the sense that equivalence classes are represented as polyhedra. 1
Simulation and Bisimulation for Probabilistic Timed Automata
"... Probabilistic timed automata are an extension of timed automata with discrete probability distributions. Simulation and bisimulation relations are widelystudied in the context of the analysis of system models, with applications in the stepwise development of systems and in model reduction. In this ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. Simulation and bisimulation relations are widelystudied in the context of the analysis of system models, with applications in the stepwise development of systems and in model reduction. In this paper, we study probabilistic timed simulation and bisimulation relations for probabilistic timed automata. We present an EXPTIME algorithm for deciding whether two probabilistic timed automata are probabilistically timed similar or bisimilar. Furthermore, we consider a logical characterization of probabilistic timed bisimulation.
Encoding timed models as uniform labeled transition systems
 In Proc. of the 10th European Performance Engineering Workshop (EPEW 2013), volume 8168 of LNCS
, 2013
"... Abstract. We provide a unifying view of timed models such as timed automata, probabilistic timed automata, and Markov automata. The timed models and their bisimulation semantics are encoded in the framework of uniform labeled transition systems. In this unifying framework, we show that the timed bi ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We provide a unifying view of timed models such as timed automata, probabilistic timed automata, and Markov automata. The timed models and their bisimulation semantics are encoded in the framework of uniform labeled transition systems. In this unifying framework, we show that the timed bisimilarities present in the literature can be reobtained and that a new bisimilarity, of which we exhibit the modal logic characterization, can be introduced for timed models including probabilities. We finally highlight similarities and differences among the models. 1