445 search results - page 13 / 89 » Model Checking Quantitative Linear Time Logic |
TACAS
2001
Springer
15 years 4 months ago
2001
Springer
ATVA
2008
Springer
15 years 2 months ago
2008
Springer
71
Voted
TOCL
2002
14 years 12 months ago
2002
108
click to vote
CORR
2010
Springer
15 years 9 days ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
CSL
2004
Springer
15 years 5 months ago
2004
Springer
The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems, ¢¡ , comprised of finite, but arbitrarily many,...