Sciweavers

2024 search results - page 277 / 405
» A Formal Model of Multi-agent Computations
Sort
View
FMSD
2008
110views more  FMSD 2008»
14 years 11 months ago
Automatic symbolic compositional verification by learning assumptions
Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
Wonhong Nam, P. Madhusudan, Rajeev Alur
CORR
2006
Springer
98views Education» more  CORR 2006»
14 years 11 months ago
Reversal Complexity Revisited
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
André Hernich, Nicole Schweikardt
JLP
2006
56views more  JLP 2006»
14 years 11 months ago
Linearization of hybrid processes
We present an algorithm for the linearization of hybrid processes modeled in hybrid process algebra (HyPA) and prove its correctness. HyPA is a formalism that is suitable for the ...
P. C. W. den Brand van, Michel A. Reniers, Pieter ...
JUCS
2006
124views more  JUCS 2006»
14 years 11 months ago
Variations on Itai-Rodeh Leader Election for Anonymous Rings and their Analysis in PRISM
Abstract: We present two probabilistic leader election algorithms for anonymous unidirectional rings with FIFO channels, based on an algorithm from Itai and Rodeh [Itai and Rodeh 1...
Wan Fokkink, Jun Pang
AI
2005
Springer
14 years 11 months ago
On the consistency of cardinal direction constraints
We present a formal model for qualitative spatial reasoning with cardinal directions utilizing a co-ordinate system. Then, we study the problem of checking the consistency of a se...
Spiros Skiadopoulos, Manolis Koubarakis