256 search results - page 11 / 52 » Temporal Logics and Model Checking for Fairly Correct System... |
ENTCS
2006
13 years 9 months ago
2006
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
FSTTCS
2010
Springer
13 years 7 months ago
2010
Springer
In this paper, we address the verification problem of ordered multi-pushdown systems: A multistack extension of pushdown systems that comes with a constraint on stack operations s...
RTSS
1997
IEEE
14 years 1 months ago
1997
IEEE
This paper presents an on-the-fly and symbolic algorithm for checking whether a timed automaton satisfies a formula of a timed temporal logic which is more expressive than TCTL....
TACAS
2005
Springer
14 years 2 months ago
2005
Springer
We present MC2 , what we believe to be the first randomized, Monte Carlo algorithm for temporal-logic model checking, the classical problem of deciding whether or not a property s...
CONCUR
1989
Springer
14 years 1 months ago
1989
Springer
In summary, RDL is an intuitionistic temporal logic for the specification of requirements and design of time-dependent systems. Coverage of RDL includes a backward chaining theore...