24 search results - page 1 / 5 » Fair Synchronous Transition Systems and Their Liveness Proof... |
FTRTFT
1998
Springer
13 years 9 months ago
1998
Springer
We present a compositional semantics of synchronous systems that captures both safety and progress properties of such systems. The fair synchronous transitions systems (fsts) mode...
WDAG
1993
Springer
13 years 8 months ago
1993
Springer
Fairness is an important concept in design and implementation of distributed systems. At the specification level, fairness usually serves as an assumption for proving liveness. At ...
FCT
2003
Springer
13 years 10 months ago
2003
Springer
We develop new proof techniques, based on non-interference, for the analysis of safety and liveness properties of cryptographic protocols expressed as terms of the process algebra ...
CONCUR
2006
Springer
13 years 8 months ago
2006
Springer
Impossible futures equivalence is the semantic equivalence on labelled transition systems that identifies systems iff they have the same "AGEF" properties: temporal logic...
ICNP
1998
IEEE
13 years 9 months ago
1998
IEEE
In protocol composition techniques, component protocols are combined in various ways to obtain a complex protocol whose execution sequences consist of interleaved execution sequen...