Sciweavers

1157 search results - page 108 / 232
» Descriptive Complexity and Model Checking
Sort
View
ESWS
2005
Springer
15 years 6 months ago
Temporal RDF
The Resource Description Framework (RDF) is a metadata model and language recommended by the W3C. This paper presents a framework to incorporate temporal reasoning into RDF, yieldi...
Claudio Gutiérrez, Carlos A. Hurtado, Aleja...
ACTA
2007
96views more  ACTA 2007»
15 years 18 days ago
Recursive Petri nets
Abstract. In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural p...
Serge Haddad, Denis Poitrenaud
100
Voted
ECAI
2010
Springer
15 years 1 months ago
A Fault-model-based Debugging Aid for Data Warehouse Applications
The paper describes a model-based approach to developing a general tool for localizing faults in applications of data warehouse technology. A model of the application is configured...
Peter Struss, Vikas Shivashankar, Mohamed Zahoor
89
Voted
ICTAI
2005
IEEE
15 years 6 months ago
Reachability Analysis for Uncertain SSPs
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...
Olivier Buffet
114
Voted
COCOON
2003
Springer
15 years 5 months ago
Petri Nets with Simple Circuits
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...
Hsu-Chun Yen, Lien-Po Yu