295 search results - page 9 / 59 » Approximating the Expressive Power of Logics in Finite Model... |
CONCUR
2004
Springer
15 years 5 months ago
2004
Springer
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
102
click to vote
FCS
2006
15 years 1 months ago
2006
- There is continuing research interest in comparison of the complexity of problems within the class NP-Complete. This paper examines the representational power of conjunctive norm...
ENTCS
2002
14 years 11 months ago
2002
We investigate a variant of dense-time Duration Calculus which permits model checking using timed/hybrid automata. We define a variant of the Duration Calculus, called Interval Du...
106
click to vote
IJAC
2010
14 years 9 months ago
2010
Title of dissertation: MODEL THEORY AND COMPLEXITY THEORY Walid Gomaa Doctor of Philosophy, 2007 Dissertation directed by: Professor William Gasarch Department of Computer Science...
111
click to vote
IANDC
2011
14 years 6 months ago
2011
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...