445 search results - page 49 / 89 » Model Checking Quantitative Linear Time Logic |
97
Voted
FOCS
1989
IEEE
15 years 6 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
15 years 2 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 ...
123
click to vote
STACS
2010
Springer
15 years 8 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...
102
click to vote
ACSAC
2010
IEEE
14 years 12 months ago
2010
IEEE
Leakage of confidential information represents a serious security risk. Despite a number of novel, theoretical advances, it has been unclear if and how quantitative approaches to ...
137
click to vote
CONCUR
1992
Springer
15 years 6 months ago
1992
Springer
The states of a computing system bear information and change time, while its events bear time and change information. We develop a primitive algebraic model of this duality of tim...