Sciweavers

30 search results - page 5 / 6
» First-Order Logic with Reachability Predicates on Infinite S...
Sort
View
SKG
2006
IEEE
13 years 10 months ago
Relation between Semantic Completeness and Syntax Completeness on General Formal Systems
Semantic completeness and syntax completeness are important characters of the general formal systems, two the completeness have different meaning for a formal system. This paper a...
Zhenghua Pan
ICDT
2009
ACM
125views Database» more  ICDT 2009»
14 years 5 months ago
How big must complete XML query languages be?
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
Clemens Ley, Michael Benedikt
CADE
2005
Springer
14 years 4 months ago
Temporal Logics over Transitive States
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
Boris Konev, Frank Wolter, Michael Zakharyaschev
ACSD
2008
IEEE
106views Hardware» more  ACSD 2008»
13 years 6 months ago
Time-bounded model checking of infinite-state continuous-time Markov chains
The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are widely used models for co...
Lijun Zhang, Holger Hermanns, Ernst Moritz Hahn, B...
TOOLS
1999
IEEE
13 years 8 months ago
Constraint Diagrams: A Step Beyond UML
The Unified Modeling Language (UML) is a set of notations for modelling object-oriented systems. It has become the de facto standard. Most of its notations are diagrammatic. An ex...
Joseph Gil, John Howse, Stuart Kent