Sciweavers

852 search results - page 41 / 171
» entcs 2010
Sort
View
ENTCS
1998
66views more  ENTCS 1998»
14 years 10 months ago
An overview of ELAN
Peter Borovanský, Claude Kirchner, Hé...
ENTCS
2007
159views more  ENTCS 2007»
14 years 10 months ago
Almost Every Domain is Universal
We endow the collection of ω-bifinite domains with the structure of a probability space, and we will show
Manfred Droste, Dietrich Kuske
ENTCS
2006
146views more  ENTCS 2006»
14 years 10 months ago
An Abstract Way to Define Rewriting Logic
act way to define rewriting logic Marc Aiguier a,1 , Diane Bahrami b , Delphine Longuet a a Universit
Marc Aiguier, Diane Bahrami, Delphine Longuet
ENTCS
2006
110views more  ENTCS 2006»
14 years 10 months ago
First Steps in Synthetic Computability Theory
Computability theory, which investigates computable functions and computable sets, lies at the foundation of computer science. Its classical presentations usually involve a fair a...
Andrej Bauer
ENTCS
2006
96views more  ENTCS 2006»
14 years 10 months ago
Weighted Timed Automata: Model-Checking and Games
In this paper, we present weighted/priced timed automata, an extension of timed automaton with costs, and solve several interesting problems on that model. Key words: Weighted/pri...
Patricia Bouyer