137 search results - page 1 / 28 » Reasoning About Transfinite Sequences |
ATVA
2005
Springer
13 years 10 months ago
2005
Springer
We introduce a family of temporal logics to specify the behavior of systems with Zeno behaviors. We extend linear-time temporal logic LTL to authorize models admitting Zeno sequen...
CONCUR
2011
Springer
12 years 4 months ago
2011
Springer
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
JSYML
2008
13 years 4 months ago
2008
We define a class of finite state automata acting on transfinite sequences, and use these automata to prove that no singular cardinal can be defined by a monadic second order formu...
LFCS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...
AAAI
2006
13 years 6 months ago
2006
We investigate the modelling of workflows, plans, and other event-generating processes as discrete event sources and reason about the possibility of having event sequences ending ...