1139 search results - page 26 / 228 » Bounded Ideation Theory |
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Most of the decision procedures for symbolic analysis of protocols are limited to a fixed set of algebraic operators associated with a fixed intruder theory. Examples o...
ICNP
1998
IEEE
14 years 15 days ago
1998
IEEE
Flow Theory is a rich, effective theory introduced in order to study real-time network protocols. It is based on discrete mathematics in which a flow of data is represented by an ...
MOBIHOC
2007
ACM
14 years 8 months ago
2007
ACM
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
AML
2005
13 years 8 months ago
2005
Abstract. We investigate the theories LA, LAP, LAP of linear algebra, which were originally defined to study the question of whether commutativity of matrix inverses has polysize F...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata ope...