528 search results - page 67 / 106 » Transition Logic Revisited |
168
click to vote
ASIAN
2003
Springer
15 years 9 months ago
2003
Springer
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
129
click to vote
IFIP
2009
Springer
15 years 9 months ago
2009
Springer
Trust dilution and trust fusion are two operators that are used to calculate transitive trust in a trust network. Various implementations of these operators already exist but are n...
143
Voted
LICS
1999
IEEE
15 years 8 months ago
1999
IEEE
Pitts and Stark have proposed the -calculus as a language for investigating the interaction of unique name generation and higher-order functions. They developed a sound model base...
127
click to vote
EUSFLAT
2003
15 years 6 months ago
2003
The aim of this paper is to present the Temporal Fuzzy Chains (TFCs) [3] to model the dynamic systems in a linguistic manner. TFCs make use of two different concepts: the traditio...
131
click to vote
IPL
2010
15 years 3 months ago
2010
Resource bisimilarity has been proposed in the literature on concurrency theory as a notion of bisimilarity over labeled transition systems that takes into account the number of c...