Sciweavers

159 search results - page 21 / 32
» Weak Equivalences in Psi-Calculi
Sort
View
106
Voted
CORR
2008
Springer
104views Education» more  CORR 2008»
15 years 23 days ago
Coalgebraic Automata Theory: Basic Results
Abstract. We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata ope...
Clemens Kupke, Yde Venema
86
Voted
JSYML
2008
71views more  JSYML 2008»
15 years 19 days ago
Strictly positive measures on Boolean algebras
We investigate strictly positive finitely additive measures on Boolean algebras and strictly positive Radon measures on compact zerodimensional spaces. The motivation is to find a ...
Mirna Dzamonja, Grzegorz Plebanek
104
Voted
LRE
2008
100views more  LRE 2008»
15 years 19 days ago
LTAG-spinal and the Treebank
Abstract. We introduce LTAG-spinal, a novel variant of traditional Lexicalized Tree Adjoining Grammar (LTAG) with desirable linguistic, computational and statistical properties. Un...
Libin Shen, Lucas Champollion, Aravind K. Joshi
100
Voted
ENTCS
2007
96views more  ENTCS 2007»
15 years 19 days ago
An Observational Theory for Mobile Ad Hoc Networks
We propose a process calculus to study the behavioural theory of Mobile Ad Hoc Networks. The operational semantics of our calculus is given both in terms of a Reduction Semantics ...
Massimo Merro
91
Voted
ENTCS
2007
81views more  ENTCS 2007»
15 years 19 days ago
Self-assembling Trees
RCCS is a variant of Milner’s CCS where processes are allowed a controlled form of backtracking. It turns out that the RCCS reinterpretation of a CCS process is equivalent, in t...
Vincent Danos, Jean Krivine, Fabien Tarissan