#### Filter Results:

- Full text PDF available (53)

#### Publication Year

2002

2017

- This year (1)
- Last 5 years (21)
- Last 10 years (47)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

We consider concurrent two-person games played in real time, in which the players decide both which action to play, and when to play it. Such timed games differ from untimed games in two essential ways. First, players can take each other by surprise, because actions are played with delays that cannot be anticipated by the opponent. Second, a player should… (More)

Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the analysis of stochastic systems, or systems with imprecise formal models, temporal logic is therefore fragile: even small changes in the model can lead to opposite truth values for a specification. We present a generalization of the branching-time logic Ctl… (More)

- Luca de Alfaro, Marco Faella, Mariëlle Stoelinga
- IEEE Transactions on Software Engineering
- 2009

We extend the classical system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted not as boolean values, but as elements of arbitrary metric spaces. Trace inclusion and equivalence give rise to asymmetrical and symmetrical linear distances, while simulation and… (More)

- B. Thomas Adler, Krishnendu Chatterjee, Luca de Alfaro, Marco Faella, Ian Pye, Vishwanath Raman
- Int. Sym. Wikis
- 2008

The Wikipedia is a collaborative encyclopedia: anyone can contribute to its articles simply by clicking on an "edit" button. The open nature of the Wikipedia has been key to its success, but has also created a challenge: how can readers develop an informed opinion on its reliability? We propose a system that computes quantitative values of trust for the… (More)

- Piero A. Bonatti, Marco Faella, Luigi Sauro
- J. Artif. Intell. Res.
- 2011

Some of the applications of OWL and RDF (e.g. biomedical knowledge representation and semantic policy formulation) call for extensions of these languages with nonmonotonic constructs such as inheritance with overriding. Nonmonotonic description logics have been studied for many years, however no practical such knowledge representation languages exist, due… (More)

- Luca de Alfaro, Marco Faella, Mariëlle Stoelinga
- ICALP
- 2004

We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted not as boolean values, but as real values in the interval [0,1]. Trace inclusion and equivalence give rise to asymmetrical and symmetrical linear distances, while simulation and bisimulation… (More)

- Piero A. Bonatti, Marco Faella, Luigi Sauro
- IJCAI
- 2009

We analyze the complexity of reasoning with circumscribed low-complexity DLs such as DL-lite and the EL family, under suitable restrictions on the use of abnormality predicates. We prove that in circumscribed DL-liteR complexity drops from NExp to the second level of the polynomial hierarchy. In EL, reasoning remains ExpTime-hard, in general. However, by… (More)

- B. Thomas Adler, Luca de Alfaro, +4 authors Pritam Roy
- CAV
- 2006

We present a brief overview of the tool Ticc (Tool for Interface Compatibility and Composition). In Ticc, a component interface describes both the behavior of a component, and the component’s assumptions on the environment’s behavior. Ticc can check the compatibility of such interfaces, and analyze their emergent behavior, via a symbolic implementation of… (More)

- Marco Faella, Salvatore La Torre, Aniello Murano
- LICS
- 2002

The rapid development of complex and safety-critical systems requires the use of reliable verification methods and tools for system design (synthesis). Many systems of interest are reactive, in the sense that their behavior depends on the interaction with the environment. A natural framework to model them is a two-player game: the system versus the… (More)

- Marco Faella, Salvatore La Torre, Aniello Murano
- Theor. Comput. Sci.
- 2002

The solution of games is a key decision problem in the context of verification of open systems and program synthesis. Given a game graph and a specification, we wish to determine if there exists a strategy of the protagonist that allows to select only behaviors fulfilling the specification. In this paper, we consider timed games, where the game graph is a… (More)