Sciweavers

20 search results - page 2 / 4
» forte 2010
Sort
View
FORTE
2010
13 years 6 months ago
Logics for Contravariant Simulations
Abstract. Covariant-contravariant simulation and conformance simulation are two generalizations of the simple notion of simulation which aim at capturing the fact that it is not al...
Ignacio Fábregas, David de Frutos-Escrig, M...
FORTE
2010
13 years 6 months ago
Exploiting the Hierarchical Structure of Rule-Based Specifications for Decision Planning
Abstract. Rule-based specifications have been very successful as a declarative approach in many domains, due to the handy yet solid foundations offered by rule-based machineries li...
Artur Boronat, Roberto Bruni, Alberto Lluch-Lafuen...
FORTE
2010
13 years 6 months ago
On Efficient Models for Model Checking Message-Passing Distributed Protocols
Abstract. The complexity of distributed algorithms, such as state machine replication, motivates the use of formal methods to assist correctness verification. The design of the for...
Péter Bokor, Marco Serafini, Neeraj Suri
FORTE
2010
13 years 6 months ago
Grouping Nodes in Wireless Sensor Networks Using Coalitional Game Theory
Wireless sensor networks are typically ad-hoc networks of resource-constrained nodes; in particular, the nodes are limited in power resources. It can be difficult and costly to rep...
Fatemeh Kazemeyni, Einar Broch Johnsen, Olaf Owe, ...
APAL
2010
125views more  APAL 2010»
13 years 5 months ago
The computable Lipschitz degrees of computably enumerable sets are not dense
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
Adam R. Day