309 search results - page 38 / 62 » Model Checking Games for Branching Time Logics |
ISSTA
2004
ACM
15 years 5 months ago
2004
ACM
Model checking based on validating temporal logic formulas has proven practical and effective for numerous software engineering applications. As systems based on this approach ha...
FOCS
1989
IEEE
15 years 3 months ago
1989
IEEE
We introduce a temporal logic for the speci cation of real-time systems. Our logic, TPTL, employs a novel quanti er construct for referencing time: the freeze quanti er binds a var...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
100
click to vote
STACS
2010
Springer
15 years 6 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
IFM
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We present a framework for model checking concurrent software systems which incorporates both states and events. Contrary to other state/event approaches, our work also i...