96 search results - page 2 / 20 » Reasoning About Systems with Transition Fairness |
FORTE
2009
13 years 2 months ago
2009
We consider the following problem: For a system consisting of two components, the behavior of one component is known as well as the desired global behavior. What should be the beha...
LPNMR
1999
Springer
13 years 8 months ago
1999
Springer
This paper continues the line of research on representing actions, on the automation of commonsense reasoning and on planning that deals with causal theories and with action langua...
FMCAD
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. Since the advent of model checking it is becoming more common for languages to be given a semantics in terms of transition systems. Such semantics allow to model check pr...
CCS
2005
ACM
13 years 10 months ago
2005
ACM
Simulatability constitutes the cryptographic notion of a secure refinement and has asserted its position as one of the fundamental concepts of modern cryptography. Although simula...
AIPS
2003
13 years 6 months ago
2003
Symmetries are inherent in systems that consist of several interchangeable objects or components. When reasoning about such systems, big computational savings can be obtained if t...