254 search results - page 30 / 51 » Model Checking Branching Time Logics |
111
click to vote
CSL
2009
Springer
15 years 10 months ago
2009
Springer
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...
133
click to vote
ISSTA
2004
ACM
15 years 9 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...
111
Voted
FOCS
1989
IEEE
15 years 7 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...
111
Voted
CORR
2010
Springer
15 years 3 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 ...
136
Voted
STACS
2010
Springer
15 years 10 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...