Sciweavers

7109 search results - page 355 / 1422
» Process Algebra with Combinators
Sort
View
DDECS
2006
IEEE
88views Hardware» more  DDECS 2006»
15 years 11 months ago
Minimization of Large State Spaces using Symbolic Branching Bisimulation
Abstract: Bisimulations in general are a powerful concept to minimize large finite state systems regarding some well-defined observational behavior. In contrast to strong bisimul...
Ralf Wimmer, Marc Herbstritt, Bernd Becker
IPPS
2006
IEEE
15 years 11 months ago
Modelling job allocation where service duration is unknown
In this paper a novel job allocation scheme in distributed systems (TAG) is modelled using the Markovian process algebra PEPA. This scheme requires no prior knowledge of job size ...
Nigel Thomas
PEWASUN
2006
ACM
15 years 11 months ago
Performance evaluation of backoff algorithms in 802.11 ad-hoc networks
Understanding the performance of backoff algorithms in multihop ad hoc networks is a key feature to design efficient Medium Access Protocols for wireless networks. The 802.11 bac...
Tahiry Razafindralambo, Fabrice Valois
SAC
2006
ACM
15 years 11 months ago
Extending noninterference properties to the timed world
Most previous work on information flow in process algebras has been based on untimed models of concurrency. It is obvious, however, that an observer might well use time to gain i...
Jian Huang, A. W. Roscoe
CSFW
2005
IEEE
15 years 10 months ago
Temporal Rank Functions for Forward Secrecy
A number of key establishment protocols claim the property of forward secrecy, where the compromise of a longterm key does not result in the compromise of previously computed sess...
Rob Delicata, Steve A. Schneider