Sciweavers

61 search results - page 10 / 13
» Decidability and Complexity Analysis of Forbidden State Prob...
Sort
View
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 10 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
QEST
2007
IEEE
14 years 1 months ago
Automated Analysis of Simulation Traces - Separating Progress from Repetitive Behavior
Among the many stages of a simulation study, debugging a simulation model is the one that is hardly reported on but that may consume a considerable amount of time and effort. In t...
Peter Kemper, Carsten Tepper
TASE
2008
IEEE
13 years 7 months ago
Modeling and Supervisory Control of Railway Networks Using Petri Nets
In this paper we deal with the problem of modeling railway networks with Petri nets so as to apply the theory of supervisory control for discrete event systems to automatically de...
Alessandro Giua, Carla Seatzu
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
14 years 1 months ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert
IPPS
1999
IEEE
13 years 11 months ago
A Formal Framework for Specifying and Verifying Time Warp Optimizations
Parallel and distributed systems are representative of large and complex systems that require the application of formal methods. These systems are often unreliable because implemen...
Victoria Chernyakhovsky, Peter Frey, Radharamanan ...