Results 11  20
of
84
SYMMETRIC STRUCTURE FOR CLOSURE ALGEBRAS
"... ABSTRACT. The aim of this paper is to investigate the variety of symmetric closure algebras, that is, closure algebras endowed with a De Morgan operator. Some general properties are derived. Particularly, the lattice of subvarieties of the subvariety of monadic and linear symmetric algebras is desc ..."
Abstract
 Add to MetaCart
ABSTRACT. The aim of this paper is to investigate the variety of symmetric closure algebras, that is, closure algebras endowed with a De Morgan operator. Some general properties are derived. Particularly, the lattice of subvarieties of the subvariety of monadic and linear symmetric algebras
ALGEBRAIC ALGORITHMS1
, 2012
"... This is a preliminary version of a Chapter on Algebraic Algorithms in the up ..."
Abstract
 Add to MetaCart
This is a preliminary version of a Chapter on Algebraic Algorithms in the up
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
, 1998
"... Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of composition, for constructing a PIOA for a composite system from a collection of PIOAs representing the components. We pr ..."
Abstract

Cited by 19 (8 self)
 Add to MetaCart
is based on symbolic calculations with vectors and matrices of rational functions, and it draws upon a theory of observables, which are mappings from delayed traces to real numbers that generalize the classical "formal power series " from algebra and combinatorics. Central to the theory is a
Models of nondeterministic regular expressions
 J. Comput. Sys. Sci
, 1999
"... Nondeterminism is a direct outcome of interactions and is, therefore a central ingredient for modelling concurrent systems. Trees are very useful for modelling nondeterministic behaviour. We aim at a treebased interpretation of regular expressions and study the effect of removing the idempotence la ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
law X+X=X and the distribution law X v(Y+Z)=X vY+X vZ from Kleene algebras. We show that the free model of the new set of axioms is a class of trees labelled over A. We also equip regular expressions with a twolevel behavioural semantics. The basic level is described in terms of a class of labelled
Aspects of endowment: a query theory of value construction.
 J. Exp. Psychol. Learn Mem. Cogn.
, 2007
"... ), in which participants are randomly given either a good, such as a coffee mug, that they may later sell ("sellers") or a choice between the good and amounts of cash ("choosers"). Sellers typically demand at least twice as much as choosers, inconsistent with economic theory. Th ..."
Abstract

Cited by 35 (5 self)
 Add to MetaCart
listing procedure used here differs from other methods for assessing reasons, such as cognitive responses 464 JOHNSON, HÄ UBL, AND KEINAN ing condition was whether, for each of the amounts, participants would prefer to get the mug or the money. 2 Market transaction. Once participants had completed the pricing task
CCS Dynamic Bisimulation is Progressing
 In Proceedings of MFCS '91. LNCS n. 520
, 1991
"... Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still woc, e.g. α.τ.β.nil and α.β.nil are woc but τ.β.nil and β.nil are not. This fact prevents us from characterizing CCS semant ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
are also congruences. We call it Dynamic Observational Congruence because it expresses a natural notion of equivalence for concurrent systems required to simulate each other in the presence of dynamic, i.e. run time, (re)configurations. We provide an algebraic characterization of Dynamic Congruence
c ○ 2005 Springer Science + Business Media, Inc. Manufactured in The Netherlands. Geometric Methods for Shape Recovery from Line Drawings of Polyhedra
"... Abstract. Using structural geometric arguments, Whiteley showed that a line drawing is a correct projection of a spherical polyhedron if and only if it has a crosssection compatible with it. We here enlarge the class of drawings to which this test applies, including those of polyhedral disks, possi ..."
Abstract
 Add to MetaCart
, possibly with perforations. This extension is helpful, as it makes the test applicable to verify and reconstruct drawings from usual scenes with opaque objects. The presented results rely on geometric constructions, thus offering an alternative approach to line drawing interpretation, complementary
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata ∗
"... Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of composition, for constructing a PIOA for a composite system from a collection of PIOAs representing the components. We pr ..."
Abstract
 Add to MetaCart
on symbolic calculations with vectors and matrices of rational functions, and it draws upon a theory of observables, which are mappings from delayed traces to real numbers that generalize the classical “formal power series” from algebra and combinatorics. Central to the theory is a notion of representation
Axiomatization of a Class of Parametrised Bisimilarities
"... The question of when two nondeterministic concurrent systems are behaviourally related has occupied a large part of the literature on process algebra and has yielded a variety of equivalences (and congruences) and preorders ( and precongruences) all based on the notion of bisimulations. Recently one ..."
Abstract
 Add to MetaCart
The question of when two nondeterministic concurrent systems are behaviourally related has occupied a large part of the literature on process algebra and has yielded a variety of equivalences (and congruences) and preorders ( and precongruences) all based on the notion of bisimulations. Recently
Results 11  20
of
84