493 search results - page 63 / 99 » Alternating Weighted Automata |
MFCS
2007
Springer
14 years 2 months ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
NETCOOP
2007
Springer
14 years 2 months ago
2007
Springer
Recently Gerald Ash has shown through case studies that event dependent routing is attractive in large scale multi-service MPLS networks. In this paper, we consider the application...
ICSEA
2006
IEEE
14 years 2 months ago
2006
IEEE
— This paper describes an innovative approach to network testing based on automatically generating and analyzing state machine models of network behavior. The models are generate...
TACAS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The automatic synthesis of programs from their specifications has been a dream of many researchers for decades. If we restrict to open finite-state reactive systems, th...
CIKM
2004
Springer
14 years 2 months ago
2004
Springer
At present, most of the state-of-the-art solutions for XML access controls are either (1) document-level access control techniques that are too limited to support fine-grained sec...