Sciweavers

8 search results - page 1 / 2
» About permutation algebras, (pre)sheaves and named sets
Sort
View
LISP
2006
117views more  LISP 2006»
13 years 3 months ago
About permutation algebras, (pre)sheaves and named sets
In this paper we survey some well-known approaches proposed as general models for calculi dealing with names (like for example process calculi with name-passing). We focus on (pre)...
Fabio Gadducci, Marino Miculan, Ugo Montanari
ENTCS
2008
91views more  ENTCS 2008»
13 years 3 months ago
A Name Abstraction Functor for Named Sets
bstraction Functor for Named Sets Vincenzo Ciancia 1 Ugo Montanari 1 Department of Computer Science University of Pisa lem of dening fully abstract operational models of name pass...
Vincenzo Ciancia, Ugo Montanari
CORR
2006
Springer
108views Education» more  CORR 2006»
13 years 3 months ago
Two polygraphic presentations of Petri nets
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...
Yves Guiraud
ECOI
2007
101views more  ECOI 2007»
13 years 3 months ago
Reasoning about taxonomies in first-order logic
Experts often disagree about the organization of biological taxa. The shifting definitions of taxonomic names complicate otherwise simple queries concerning these taxa. For examp...
David Thau, Bertram Ludäscher
ICITS
2009
13 years 1 months ago
Linear Threshold Multisecret Sharing Schemes
In a multisecret sharing scheme, several secret values are distributed among a set of n users, and each secret may have a different associated access structure. We consider here un...
Oriol Farràs, Ignacio Gracia, Sebasti&agrav...