Sciweavers

528 search results - page 67 / 106
» Transition Logic Revisited
Sort
View
ASIAN
2003
Springer
170views Algorithms» more  ASIAN 2003»
15 years 11 months ago
Model Checking Probabilistic Distributed Systems
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...
Benedikt Bollig, Martin Leucker
IFIP
2009
Springer
15 years 10 months ago
An Algebra for Trust Dilution and Trust Fusion
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...
Baptiste Alcalde, Sjouke Mauw
168
Voted
LICS
1999
IEEE
15 years 10 months ago
Towards a Theory of Bisimulation for Local Names
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...
Alan Jeffrey, Julian Rathke
EUSFLAT
2003
15 years 7 months ago
Modelling with temporal fuzzy chains
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...
Juan Moreno García, Luis Jiménez, Jo...
IPL
2010
95views more  IPL 2010»
15 years 4 months ago
Resource bisimilarity and graded bisimilarity coincide
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...
Luca Aceto, Anna Ingólfsdóttir, Josh...