528 search results - page 57 / 106 » Transition Logic Revisited |
120
click to vote
CADE
2007
Springer
16 years 2 months ago
2007
Springer
We present an encoding that is able to specify LTL bounded model checking problems within the Bernays-Sch?onfinkel fragment of first-order logic. This fragment, which also correspo...
111
click to vote
CONCUR
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We introduce model-checking games that allow local secondorder power on sets of independent transitions in the underlying partial order models where the games are played....
124
click to vote
ICLP
2010
Springer
15 years 5 months ago
2010
Springer
[6]. An SBML model can be interpreted in Biocham at three abstraction levels: • the Boolean semantics (asynchronuous Boolean state transitions on the presence/absence of molecule...
124
click to vote
DLOG
2006
15 years 3 months ago
2006
Abstract. Model checking is a fully automated technique for determining whether the behaviour of a finite-state reactive system satisfies a temporal logic specification. Despite th...
124
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...