713 search results - page 62 / 143 » Model Checking and Transitive-Closure Logic |
114
Voted
AAAI
2006
15 years 14 days ago
2006
This paper presents a computational model of negotiation based on Nebel's syntax-based belief revision. The model guarantees a unique bargaining solution for each bargaining ...
127
click to vote
DLT
2009
14 years 8 months ago
2009
Abstract. Temporal logics are a well investigated formalism for the specification and verification of reactive systems. Using formal verification techniques, we can ensure the corr...
FUIN
2010
14 years 8 months ago
2010
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
109
click to vote
CONCUR
2007
Springer
15 years 5 months ago
2007
Springer
The model checking problem for finite-state open systems (module checking) has been extensively studied in the literature, both in the context of environments with perfect and imp...
100
click to vote
WWW
2006
ACM
15 years 11 months ago
2006
ACM
The need of formal verification is a problem that involves all the fields in which sensible data are managed. In this context the verification of data streams became a fundamental...