56 search results - page 9 / 12 » On Decidability of LTL Model Checking for Process Rewrite Sy... |
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Recent contributions to advancing planning from the classical model to more realistic problems include using temporal logic such as LTL to express desired properties of a solution ...
ASPDAC
2009
ACM
14 years 5 days ago
2009
ACM
— This paper proposes the first automatic approach to simultaneously generate Cycle Accurate and Cycle Count Accurate transaction level bus models. Since TLM (Transaction Level M...
ICDT
2011
ACM
12 years 11 months ago
2011
ACM
Distributed data management systems consist of peers that store, exchange and process data in order to collaboratively achieve a common goal, such as evaluate some query. We study...
SIGMOD
1996
ACM
13 years 11 months ago
1996
ACM
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
ACTA
2007
13 years 7 months ago
2007
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...