240 search results - page 1 / 48 » Infinite trace equivalence |
FOSSACS
2004
Springer
13 years 8 months ago
2004
Springer
We prove that if a finite alphabet of actions contains at least two elements, then the equational theory for the process algebra BCCSP modulo any semantics no coarser than readines...
CADE
2010
Springer
13 years 6 months ago
2010
Springer
We consider security properties of cryptographic protocols, that are either trace properties (such as confidentiality or authenticity) or equivalence properties (such as anonymity ...
APAL
2008
13 years 5 months ago
2008
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
ECAI
2010
Springer
13 years 2 months ago
2010
Springer
The language of linear temporal logic (LTL) has been proposed as a formalism for specifying temporally extended goals and search control constraints in planning. However, the seman...
FUIN
2010
13 years 2 months ago
2010
The construction of an associative -product of traces from an earlier paper is revisited using projection representation of traces. Using projections instead of trace prefixes res...