Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,688
Determinacy → (observation equivalence = trace equivalence
- Theoretical Computer Science
, 1985
"... Abstract. If an experiment s is conducted on a parallel process p, then, in general, different processes may result from the experiment, due to the nondeterministic behaviour of p (in the notation of Milner (1980): p ~ p ' for different p'). Process p is called determinate if the resulting ..."
Abstract
-
Cited by 19 (0 self)
- Add to MetaCart
denote (the much weaker) failure equivalence, used for CSP (Hoare et al., 1981; Brookes, 1983), and let- t denote (the still weaker) trace equivalence. We show that the three corresponding notions of determinacy are the same, and that for determinate processes-~,- f, and- t are the same. Determinacy
Abstract Infinite Trace Equivalence
"... We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. We discuss the difficulties with traditional approaches, where divergence is bottom or where a term denotes a function fro ..."
Abstract
- Add to MetaCart
extend the model to a calculus with higher-order and recursive types, by adapting standard game semantics. Traditional adequacy proofs using logical relations are not applicable, so we use instead a novel hiding and unhiding argument. Key words: nondeterminism, infinite traces, game semantics, Jump-With-Argument
Decidability of trace equivalence for protocols with nonces
"... Abstract—Privacy properties such as anonymity, unlinkability, or vote secrecy are typically expressed as equivalence properties. In this paper, we provide the first decidability result for trace equivalence of security protocols, for an unbounded number of sessions and unlimited fresh nonces. Our cl ..."
Abstract
- Add to MetaCart
Abstract—Privacy properties such as anonymity, unlinkability, or vote secrecy are typically expressed as equivalence properties. In this paper, we provide the first decidability result for trace equivalence of security protocols, for an unbounded number of sessions and unlimited fresh nonces. Our
APTE (Algorithm for Proving Trace Equivalence
, 2013
"... Abstract. This paper presents APTE, a new tool for automatically proving the security of cryptographic protocols. It focuses on proving trace equivalence between processes, which is crucial for specifying pri-vacy type properties such as anonymity and unlinkability. The tool can handle protocols exp ..."
Abstract
-
Cited by 5 (3 self)
- Add to MetaCart
Abstract. This paper presents APTE, a new tool for automatically proving the security of cryptographic protocols. It focuses on proving trace equivalence between processes, which is crucial for specifying pri-vacy type properties such as anonymity and unlinkability. The tool can handle protocols
Trace equivalence decision: Negative tests and non-determinism
- IN: CCS’11
, 2011
"... We consider security properties of cryptographic protocols that can be modeled using the notion of trace equivalence. The notion of equivalence is crucial when specifying privacy-type properties, like anonymity, vote-privacy, and unlinkability. In this paper, we give a calculus that is close to the ..."
Abstract
-
Cited by 25 (9 self)
- Add to MetaCart
We consider security properties of cryptographic protocols that can be modeled using the notion of trace equivalence. The notion of equivalence is crucial when specifying privacy-type properties, like anonymity, vote-privacy, and unlinkability. In this paper, we give a calculus that is close
Testing Trace Equivalence for Labeled Transition Systems
, 1995
"... : In this paper, we consider the problem on conformance testing of communication protocols which are modeled by labeled transition systems. The conformance requirements of specifications are represented as the trace equivalence relation and derived test suites have finite behavior and provide well-d ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
: In this paper, we consider the problem on conformance testing of communication protocols which are modeled by labeled transition systems. The conformance requirements of specifications are represented as the trace equivalence relation and derived test suites have finite behavior and provide well
Trace Equivalence Characterization Through Reinforcement Learning
"... Abstract. In the context of probabilistic verification, we provide a new notion of trace-equivalence divergence between pairs of Labelled Markov processes. This divergence corresponds to the optimal value of a par-ticular derived Markov Decision Process. It can therefore be estimated by Reinforcemen ..."
Abstract
- Add to MetaCart
Abstract. In the context of probabilistic verification, we provide a new notion of trace-equivalence divergence between pairs of Labelled Markov processes. This divergence corresponds to the optimal value of a par-ticular derived Markov Decision Process. It can therefore be estimated
Modal Logic Characterization of Markovian Testing and Trace Equivalences
- in Proc. of the 1st Int. Workshop on Logic, Models and Computer Science (LMCS 2006), ENTCS
, 2006
"... Markovian testing and trace equivalences have been recently proposed as reasonable alternatives to Markovian bisimilarity, as both of them induce at the Markov chain level an aggregation strictly coarser than ordinary lumping that is still exact. In this paper we provide a modal logic characterizati ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
Markovian testing and trace equivalences have been recently proposed as reasonable alternatives to Markovian bisimilarity, as both of them induce at the Markov chain level an aggregation strictly coarser than ordinary lumping that is still exact. In this paper we provide a modal logic
Checking Experiments with Labeled Transition Systems for Trace Equivalence
"... : We apply the state identification techniques for testing communication systems which are modeled labeled transition systems (LTSs). The conformance requirements of specifications are represented as the trace equivalence relation and derived tests have finite behavior and provide well-defined fault ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
: We apply the state identification techniques for testing communication systems which are modeled labeled transition systems (LTSs). The conformance requirements of specifications are represented as the trace equivalence relation and derived tests have finite behavior and provide well
Results 1 - 10
of
1,688
