Results 1  10
of
675,188
Schnorr triviality and its equivalent notions
 Theory of Computing Systems
"... We give some new characterizations of Schnorr triviality. In concrete terms, we introduce a reducibility related to decidable prefixfree machines and show the equivalence with Schnorr reducibility. We also give a uniformSchnorrrandomness version of the equivalence of LRreducibility and LKreduc ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We give some new characterizations of Schnorr triviality. In concrete terms, we introduce a reducibility related to decidable prefixfree machines and show the equivalence with Schnorr reducibility. We also give a uniformSchnorrrandomness version of the equivalence of LRreducibility and LK
Equivalence notions and model minimization in Markov decision processes
, 2003
"... Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for solving them run in time polynomial in the size of the state space, where this size is extremely large for most realworld ..."
Abstract

Cited by 116 (2 self)
 Add to MetaCart
of equivalence between states used in the aggregation. The notion of equivalence chosen will be fundamental in designing and analyzing
The role of selfattacking arguments in characterizations of equivalence notions
 Journal of Logic and Computation: Special Issue
, 2014
"... A special case of loops in argumentation are selfattacking arguments. While their role with respect to the ontological nature of argumentation setting of Dungstyle argumentation frameworks seems to be less crucial for semantics or fundamental properties. There are, however, a few exceptions where ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
tions where selfattacking arguments have essential influence. One such exception concerns characterizations of (strong) equivalence notions between argumentation frameworks. Different notions of equivalence have recently been proposed in the literature and several characterization results for different
Refinement of Actions and Equivalence Notions for Concurrent Systems
 Acta Informatica
, 1998
"... This paper combines and extends the material of [GGa/c/d/e], except for the part in [GGc] on refinement of transitions in Petri nets and the discussion of TCSPlike parallel composition in [GGe]. An informal presentation of some basic ingredients of this paper appeared as [GGb]. Among others, th ..."
Abstract

Cited by 59 (3 self)
 Add to MetaCart
This paper combines and extends the material of [GGa/c/d/e], except for the part in [GGc] on refinement of transitions in Petri nets and the discussion of TCSPlike parallel composition in [GGe]. An informal presentation of some basic ingredients of this paper appeared as [GGb]. Among others, the treatment of action refinement in stable and nonstable event structures is new. The research reported here was supported by Esprit project 432 (METEOR), Esprit Basic Research Action 3148 (DEMON), Sonderforschungsbereich 342 of the TU Munchen, ONR grant N0001492J1974 and the Human Capital and Mobility Cooperation Network EXPRESS (Expressiveness of Languages for Concurrency). Contents
Čirovič, On some equivalence notions of synchronous systems
 Proceedings, 11th International Conference on Automata and Formal Languages, Dogogókő, Hungary
, 2005
"... An important optimization tool in the design of synchronous systems is retiming, which in many cases allows a significant reduction in the length of the systems ’ clock period. Even though the internal structure of systems changes upon retiming, their inputoutput behavior remains essentially the sa ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
the same. The original system and the one after the retiming can simulate each other in a suitable way. The equivalence notion arising from this kind of mutual simulation is called simulation equivalence, and the aim of this paper is to characterize simulation equivalence in an algebraic setting
Notions of Computation and Monads
, 1991
"... The i.calculus is considered a useful mathematical tool in the study of programming languages, since programs can be identified with Iterms. However, if one goes further and uses bnconversion to prove equivalence of programs, then a gross simplification is introduced (programs are identified with ..."
Abstract

Cited by 881 (16 self)
 Add to MetaCart
with total functions from calues to values) that may jeopardise the applicability of theoretical results, In this paper we introduce calculi. based on a categorical semantics for computations, that provide a correct basis for proving equivalence of programs for a wide range of notions of computation.
A Behavioral Notion of Subtyping
 ACM Transactions on Programming Languages and Systems
, 1994
"... The use of hierarchy is an important component of objectoriented design. Hierarchy allows the use of type families, in which higher level supertypes capture the behavior that all of their subtypes have in common. For this methodology to be effective, it is necessary to have a clear understanding of ..."
Abstract

Cited by 514 (18 self)
 Add to MetaCart
is easy for programmers to use. The subtype relation is based on the specifications of the sub and supertypes; the paper presents a way of specifying types that makes it convenient to define the subtype relation. The paper also discusses the ramifications of this notion of subtyping on the design of type
Diachronic Uncertainty and Equivalence Notions for ETL Models of Extensive Form Games
"... Diachronic uncertainty, uncertainty about where an agent falls in time, poses interesting conceptual difficulties. Although the agent is uncertain about where she falls in time, nevertheless, she can only be uncertain at a particular moment in time. This conceptual paradox can be resolved by provi ..."
Abstract
 Add to MetaCart
by providing an equivalence notion between models with diachronic uncertainty and models with synchronic uncertainty. The former are interpreted as capturing the causal structure of a situation, while the latter are interpreted as capturing its epistemic structure. We consider some of the properties
A Class of Stochastic Petri Nets with Step Semantics and Related Equivalence Notions
, 2000
"... This paper presents a class of Stochastic Petri Nets with concurrent transition rings. It is assumed that transitions occur in steps and that for every step each enabled transition decides probabilistically whether it wants to participate in the step or not. Among the transitions which want to parti ..."
Abstract
 Add to MetaCart
and bisimulation equivalences for systems with step semantics to Stochastic Petri Nets with concurrent transition ring. It is shown that the equivalence notions form a lattice of interrelations. Keywords: Stochastic Petri Nets, Step Semantics, Equivalence Relations, Bisimulation. 1 Introduction Stochastic Petri
A calculus for cryptographic protocols: The spi calculus
 Information and Computation
, 1999
"... We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols; the ..."
Abstract

Cited by 919 (55 self)
 Add to MetaCart
; the spi calculus enables us to consider cryptographic issues in more detail. We represent protocols as processes in the spi calculus and state their security properties in terms of coarsegrained notions of protocol equivalence.
Results 1  10
of
675,188