955 search results - page 135 / 191 » Tractable Temporal Reasoning |
TACAS
2005
Springer
15 years 5 months ago
2005
Springer
Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumptions are specified in terms of sets of states. The analysis of fair discrete sy...
120
click to vote
ASIAN
2003
Springer
15 years 5 months ago
2003
Springer
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
CSL
2009
Springer
15 years 4 months ago
2009
Springer
This paper extends for the first time semantic interpretation tools to infinite data in order to ensure Input/Output upper bounds on first order Haskell like programs on streams...
KI
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. Agents situated in proactive environments are acting autonomously while the environment is evolving alongside, whether or not the agents carry out any particular actions....
FMCAD
2006
Springer
15 years 3 months ago
2006
Springer
Recent years have seen a proliferation of 3-valued or capturing abstractions of systems, since these enable verifying both universal and existential properties. Reasoning about suc...