7118 search results - page 914 / 1424 » Electrical and Computer Engineering |
148
click to vote
FOSSACS
2004
Springer
15 years 10 months ago
2004
Springer
The pi calculus holds the promise of compile-time checks for whether a given program will have the correct interactive behaviour. The theory behind such checks is called bisimulati...
174
click to vote
FOSSACS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
127
click to vote
FOSSACS
2004
Springer
15 years 10 months ago
2004
Springer
Labelled Markov processes (LMPs) are automata whose transitions are given by probability distributions. In this paper we present a ‘universal’ LMP as the spectrum of a commutat...
120
Voted
FOSSACS
2004
Springer
15 years 10 months ago
2004
Springer
This paper compares the expressiveness of ambient calculi against different dialects of the pi-calculus. Cardelli and Gordon encoded the asynchronous pi-calculus into their calcul...
152
click to vote
FSTTCS
2004
Springer
15 years 10 months ago
2004
Springer
The join of two sets of facts, E1 and E2, is defined as the set of all facts that are implied independently by both E1 and E2. Congruence closure is a widely used representation f...