Sciweavers

5084 search results - page 303 / 1017
» Proving Possibility Properties
Sort
View
APIN
2005
94views more  APIN 2005»
15 years 6 months ago
Extension of Petri Nets for Representing and Reasoning with Tasks with Imprecise Durations
This paper presents an extension of Petri net framework with imprecise temporal properties. We use possibility theory to represent imprecise time by time-stamping tokens and assig...
Stanislav Kurkovsky, Rasiah Loganantharaj
CSSE
2002
IEEE
15 years 6 months ago
A fault tolerant access to legacy database systems using CORBA technology
This work presents a software-implemented fault tolerance approach for building a reliable database application in a CORBA environment. Database applications have functional requi...
Domenico Cotroneo, Nicola Mazzocca, Luigi Romano, ...
JSAC
2010
120views more  JSAC 2010»
15 years 5 months ago
A simple and scalable algorithm for alignment in broadcast networks
We consider the problem of coordinating a group of mobile nodes communicating through a wireless medium. The objective of the network is the alignment of all the nodes towards a c...
Roberto Pagliari, Mehmet E. Yildiz, Shrut Kirti, K...
LICS
2010
IEEE
15 years 5 months ago
On Strong Maximality of Paraconsistent Finite-Valued Logics
Abstract—Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain as much as possible fro...
Arnon Avron, Ofer Arieli, Anna Zamansky
187
Voted
SPLC
2010
15 years 4 months ago
Configuring Software Product Line Feature Models Based on Stakeholders' Soft and Hard Requirements
Abstract. Feature modeling is a technique for capturing commonality and variability. Feature models symbolize a representation of the possible application configuration space, and ...
Ebrahim Bagheri, Tommaso Di Noia, Azzurra Ragone, ...