Results 1  10
of
2,006,917
On Observational Equivalence and Algebraic Specification
, 1987
"... The properties of a simple and natural notion of observational equivalence of algebras and the corresponding specificationbuilding operation are studied. We begin with a defmition of observational equivalence which is adequate to handle reachable algebras only, and show how to extend it to cope wit ..."
Abstract

Cited by 66 (14 self)
 Add to MetaCart
The properties of a simple and natural notion of observational equivalence of algebras and the corresponding specificationbuilding operation are studied. We begin with a defmition of observational equivalence which is adequate to handle reachable algebras only, and show how to extend it to cope
SYNTHESIS OBSERVATION EQUIVALENCE AND WEAK SYNTHESIS OBSERVATION EQUIVALENCE
, 2012
"... This working paper proposes an algorithm to simplify automata in such a way that compositional synthesis results are preserved in every possible context. It relaxes some requirements of synthesis observation equivalence from previous work, so that better abstractions can be obtained. The paper descr ..."
Abstract
 Add to MetaCart
This working paper proposes an algorithm to simplify automata in such a way that compositional synthesis results are preserved in every possible context. It relaxes some requirements of synthesis observation equivalence from previous work, so that better abstractions can be obtained. The paper
Computational Soundness of Observational Equivalence
, 2008
"... Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishability can be considerably simplified, for a class of processes that covers most existing protocols. More precisely, we show ..."
Abstract

Cited by 38 (9 self)
 Add to MetaCart
a soundness theorem, following the line of research launched by Abadi and Rogaway in 2000: computational indistinguishability in presence of an active attacker is implied by the observational equivalence of the corresponding symbolic processes. We prove our result for symmetric encryption
On Observational Equivalence and Compiler Correctness
 In Proc. ICCI'94, Int. Conf. on Computing and Information
, 1994
"... We study the problem of giving proofs of compiler correctness in the framework of observational equivalence [16] and correspondences [17]. The starting point for correctness is a formal semantics of the programming language given in a form of Structural Operational Semantics [15] wich we call Rel ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study the problem of giving proofs of compiler correctness in the framework of observational equivalence [16] and correspondences [17]. The starting point for correctness is a formal semantics of the programming language given in a form of Structural Operational Semantics [15] wich we call
Observational Equivalences for Logic Programs
 Proc. Joint Int'l Conf. and Symposium on Logic Programming
, 1992
"... We first introduce a general semantic scheme for logic programs which provides a uniform framework for defining different compositional semantics parametrically wrt a given notion of observable. The equivalence of the operational (topdown) and fixpoint (bottomup) costruction of the semantics is en ..."
Abstract

Cited by 14 (9 self)
 Add to MetaCart
We first introduce a general semantic scheme for logic programs which provides a uniform framework for defining different compositional semantics parametrically wrt a given notion of observable. The equivalence of the operational (topdown) and fixpoint (bottomup) costruction of the semantics
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 20 (0 self)
 Add to MetaCart
if the resulting processes are all equivalent (i.e., if p A=> p ' and p ~ p", then p ' and p " are equivalent). This means that, although p behaves nondeterministically, this cannot be detected by an observer of p. Let denote observation equivalence, used in CCS (Milner, 1980), let f
Modal Observation Equivalence of Processes
, 1995
"... This paper shows that many simulation equivalences over processes can be characterised by a single parameterised modal logic formula. For many equivalences oe there is a parameterised modal logic formula f(t) such that for every pair of processes P and Q, P oe Q if and only if P j= f(Q). For any s ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
This paper shows that many simulation equivalences over processes can be characterised by a single parameterised modal logic formula. For many equivalences oe there is a parameterised modal logic formula f(t) such that for every pair of processes P and Q, P oe Q if and only if P j= f(Q). For any
ON THE OBSERVATIONAL EQUIVALENCE OF RANDOM MATCHING
"... Abstract. Random matching is often used in economic models as a means of introducing uncertainty in sequential decision problems. We show that random matching processes that satisfy standard proportionality laws are not unique. We give conditions on the payo¤s and transitions functions of sequential ..."
Abstract
 Add to MetaCart
Abstract. Random matching is often used in economic models as a means of introducing uncertainty in sequential decision problems. We show that random matching processes that satisfy standard proportionality laws are not unique. We give conditions on the payo¤s and transitions functions of sequential decision models that insure that the models are robust to the nonuniqueness of the matching process. Under these conditions, the information contained in the proportionality laws is all is needed to know about the matching process to formulate the model.
On the Use of Observation Equivalence in Synthesis Abstraction
"... Abstract—In a previous paper we introduced the notion of synthesis abstraction, which allows efficient compositional synthesis of maximally permissive supervisors for largescale systems of composed finitestate automata. In the current paper, observation equivalence is studied in relation to synth ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract—In a previous paper we introduced the notion of synthesis abstraction, which allows efficient compositional synthesis of maximally permissive supervisors for largescale systems of composed finitestate automata. In the current paper, observation equivalence is studied in relation
Results 1  10
of
2,006,917