232 search results - page 30 / 47 » Termination of linear bounded term rewriting systems |
AUTOMATICA
2007
13 years 7 months ago
2007
In this paper, we define the notion of approximate bisimulation relation between two continuous systems. While exact bisimulation requires that the observations of two systems ar...
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted n...
TSP
2010
13 years 2 months ago
2010
This paper proposes a linear transmitter design that aims at minimizing the packet error rate (PER) using partial channel state information at the transmitter (CSIT). The design is...
ESOP
2009
Springer
14 years 2 months ago
2009
Springer
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
CORR
2009
Springer
13 years 5 months ago
2009
Springer
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...