240 search results - page 29 / 48 » Infinite trace equivalence |
IANDC
2006
14 years 11 months ago
2006
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We consider games played on finite graphs, whose goal is to obtain a trace belonging to a given set of winning traces. We focus on those states from which Player 1 cannot force a w...
105
click to vote
ASIACRYPT
2003
Springer
15 years 5 months ago
2003
Springer
In this paper1 we propose a new symmetric block cipher with the following paradoxical traceability properties: it is computationally easy to derive many equivalent secret keys prov...
FAC
2006
14 years 11 months ago
2006
In modular approaches to specify concurrent systems a system is built up from components using various operators as e.g. the sequential, the parallel, or the choice (+) operator. U...
QSIC
2007
IEEE
15 years 6 months ago
2007
IEEE
In this paper we propose a metric for finite processes in a probabilistic extension of CSP. The kernel of the metric corresponds to trace equivalence and most of the operators in...