275 search results - page 12 / 55 » The Complexity of Generalized Satisfiability for Linear Temp... |
JELIA
1994
Springer
13 years 11 months ago
1994
Springer
: In this paper we describe a general way of formalizing reasoning behaviour. Such a behaviour may be described by all the patterns which are valid for the behaviour. A pattern can...
CONCUR
1999
Springer
14 years 4 hour ago
1999
Springer
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general se...
CDC
2009
IEEE
14 years 13 days ago
2009
IEEE
— This paper bridges the advances in computer science and control to allow automatic synthesis of control strategies for complex dynamical systems which are guaranteed, by constr...
LICS
2005
IEEE
14 years 1 months ago
2005
IEEE
Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words...
PODS
2009
ACM
14 years 8 months ago
2009
ACM
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...