Sciweavers

1679 search results - page 106 / 336
» Strong order equivalence
Sort
View
FASE
2000
Springer
14 years 1 months ago
A Process Algebra for Real-Time Programs
Abstract. We introduce a generalised notion of a real-time speci cation language (\GPLC-Automata") that can be translated directly into real-time programs. In order to describ...
Henning Dierks
PLILP
1994
Springer
14 years 1 months ago
Deriving Residual Reference Count Garbage Collectors
We present a strategy to derive an efficient reference count garbage collector for any applicative program by only modifying it on the source code level. The key to the approach is...
Wolfram Schulte
EUSFLAT
2007
131views Fuzzy Logic» more  EUSFLAT 2007»
13 years 11 months ago
Preservation of Graded Properties of Fuzzy Relations by Aggregation Functions
We study graded properties (α–properties) of fuzzy relations, which are parameterized versions of fuzzy relation properties defined by L.A. Zadeh. Namely, we take into account...
Urszula Dudziak
MCU
1998
117views Hardware» more  MCU 1998»
13 years 11 months ago
The Turing Closure of an Archimedean Field
A BSS machine is -uniform if it does not use exact tests; such machines are equivalent (modulo parameters) to Type 2 Turing machines. We define a notion of closure related to Turi...
Paolo Boldi, Sebastiano Vigna
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 10 months ago
The complexity of linear-time temporal logic over the class of ordinals
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...
Stéphane Demri, Alexander Rabinovich