Sciweavers

1705 search results - page 10 / 341
» Representing Constraints with Automata
Sort
View
ENTCS
2008
105views more  ENTCS 2008»
13 years 7 months ago
Checking Equivalence for Reo Networks
Constraint automata have been used as an operational model for component connectors described in the coordination language Reo which specifies the cooperation and communication of...
Tobias Blechmann, Christel Baier
CORR
2008
Springer
89views Education» more  CORR 2008»
13 years 7 months ago
Disjunctive Databases for Representing Repairs
This paper addresses the problem of representing the set of repairs of a possibly inconsistent database by means of a disjunctive database. Specifically, the class of denial constr...
Cristian Molinaro, Jan Chomicki, Jerzy Marcinkowsk...
IPL
2008
79views more  IPL 2008»
13 years 7 months ago
On the efficient construction of quasi-reversible automata for reversible languages
Quasi-reversible automata is a suitable representation for reversible languages. In this work a method is proposed to obtain such an automaton for any given reversible language re...
Pedro García, Manuel Vazquez de Parga, Dami...
WSC
2007
13 years 10 months ago
Expecting the unexpected: representing, reasoning about, and assessing construction project contingencies
Planning, scheduling and effective management of contingencies are crucial for the successful management of construction projects. In this paper we explore a mathematical represen...
G. Ryan Anderson, Nilufer Onder, Amlan Mukherjee
FSTTCS
2004
Springer
14 years 1 months ago
Optimal Strategies in Priced Timed Game Automata
Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability priced timed game automata and prove ...
Patricia Bouyer, Franck Cassez, Emmanuel Fleury, K...