528 search results - page 70 / 106 » Transition Logic Revisited |
134
Voted
ATAL
2005
Springer
15 years 10 months ago
2005
Springer
We present an approach to the verification of temporal epistemic properties in synchronous multi-agent systems (MAS) via bounded model checking (BMC). Based on the semantics of s...
133
click to vote
ISLPED
2004
ACM
15 years 10 months ago
2004
ACM
In this paper we investigate the statistics of multiplier operands and identify two characteristics of their distribution that have important consequences for the design of low po...
132
click to vote
ICSE
2001
IEEE-ACM
15 years 9 months ago
2001
IEEE-ACM
Mocha is a model checker based on the theme of exploiting design modularity: instead of manipulating unstructured state-transition graphs, it supports the hierarchical modeling fra...
168
click to vote
ERSHOV
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We address model checking problem for combination of Computation Tree Logic (CTL) and Propositional Logic of Knowledge (PLK) in finite systems with the perfect recall syn...
126
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...