Sciweavers

3122 search results - page 10 / 625
» A Theory of Network Equivalence
Sort
View
JUCS
2007
95views more  JUCS 2007»
14 years 9 months ago
Equivalent Transformations of Automata by Using Behavioural Automata
: This paper uses category theory to emphasize the relationships between Mealy, Moore and Rabin-Scott automata, and the behavioural automata are used as a unifying framework. Some ...
Gabriel Ciobanu, Sergiu Rudeanu
GLOBECOM
2006
IEEE
15 years 3 months ago
A Network Calculus Approach to Probabilistic Quality of Service Analysis of Fading Channels
Abstract— Network calculus is an established theory for deterministic quality of service analysis of fixed networks. Due to the failures inherent in fading channels it is, howev...
Markus Fidler
SIGCOMM
2012
ACM
13 years 2 days ago
Route shepherd: stability hints for the control plane
The Route Shepherd tool demonstrates applications of choosing between routing protocol configurations on the basis of rigorouslysupported theory. Splitting the configuration spa...
Alexander J. T. Gurney, Xianglong Han, Yang Li, Bo...
FSEN
2009
Springer
15 years 4 months ago
A Process-Theoretic Look at Automata
Automata theory presents roughly three types of automata: finite automata, pushdown automata and Turing machines. The automata are treated as language acceptors, and the expressiv...
Jos C. M. Baeten, Pieter J. L. Cuijpers, Bas Lutti...
AML
2008
53views more  AML 2008»
14 years 9 months ago
Pairs, sets and sequences in first-order theories
In this paper we study the idea of theories with containers, like sets, pairs, sequences. We provide a modest framework to study such theories. We prove two concrete results. Firs...
Albert Visser