1705 search results - page 133 / 341 » Representing Constraints with Automata |
128
click to vote
NETCOOP
2007
Springer
15 years 10 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...
157
Voted
RTA
2007
Springer
15 years 10 months ago
2007
Springer
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
132
click to vote
SAFECOMP
2007
Springer
15 years 10 months ago
2007
Springer
With the rapid progress in science and technology, we find ubiquitous use of safety-critical systems in avionics, consumer electronics, and medical instruments. In such systems, u...
113
Voted
STACS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...
116
click to vote
CIMCA
2006
IEEE
15 years 10 months ago
2006
IEEE
The MPSG (Message-based Part State Graph) model has been developed for the execution portion of shop-floor controllers that operate in a distributed and hierarchical control envir...