475 search results - page 24 / 95 » Temporal Logic Model Checking (Abstract) |
149
click to vote
FSTTCS
2010
Springer
15 years 3 months ago
2010
Springer
In this paper, we address the verification problem of ordered multi-pushdown systems: A multistack extension of pushdown systems that comes with a constraint on stack operations s...
172
click to vote
ECAI
2008
Springer
15 years 7 months ago
2008
Springer
Formal verification based on model checking provides a powerful technology to query qualitative models of dynamical systems. The application of model-checking approaches is hamper...
183
click to vote
RTSS
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper presents an on-the-fly and symbolic algorithm for checking whether a timed automaton satisfies a formula of a timed temporal logic which is more expressive than TCTL....
150
click to vote
LICS
2002
IEEE
15 years 10 months ago
2002
IEEE
We investigate NLTL, a linear-time temporal logic with forgettable past. NLTL can be exponentially more succinct than LTL + Past (which in turn can be more succinct than LTL). We ...
160
click to vote
CONCUR
1999
Springer
15 years 10 months 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...