15860 search results - page 2625 / 3172 » Agent-Based Software Engineering |
156
click to vote
FOSSACS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the D...
122
click to vote
FOSSACS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In order to study relative PCF-definability of boolean functions, we associate a hypergraph Hf to any boolean function f (following [3, 5]). We introduce the notion of t...
154
click to vote
FOSSACS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Using a probabilistic polynomial-time process calculus designed for specifying security properties as observational equivalences, we develop a form of bisimulation that j...
171
Voted
FOSSACS
2004
Springer
15 years 11 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...
201
click to vote
FOSSACS
2004
Springer
15 years 11 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...