3729 search results - page 131 / 746 » On Formal Modeling of Agent Computations |
181
click to vote
JCST
2010
15 years 1 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
168
click to vote
FMCO
2003
Springer
15 years 11 months ago
2003
Springer
Recently we proposed a mathematical framework offering diverse models of computation and a formal foundation for correct-byconstruction deployment of synchronous designs over dist...
157
click to vote
IPPS
2007
IEEE
16 years 20 days ago
2007
IEEE
This paper investigates the suitability of applying the general-purpose Real-Time Maude tool to the formal specification and model checking analysis of timedependent cryptographi...
165
click to vote
ECOOPW
1994
Springer
15 years 10 months ago
1994
Springer
A composition language based on a formal semantic foundation will facilitate precification of glue abstractions and compositions, and will support reasoning about their behaviour....
148
click to vote
FUIN
2002
15 years 6 months ago
2002
Abstract. In this paper we give a complete formalization of a new computability model of a distributed parallel type which is inspired by some basic features of living cells: trans...