Sciweavers

6978 search results - page 1318 / 1396
» On Proofs in System P
Sort
View
ICALP
1998
Springer
14 years 1 months ago
Deciding Bisimulation-Like Equivalences with Finite-State Processes
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
Petr Jancar, Antonín Kucera, Richard Mayr
ICCCN
1997
IEEE
14 years 1 months ago
Design and implementation of a QoS capable switch-router
Rapid expansion has strained the capabilities of the Internet infrastructure. Emerging audio and video applications place further demands on already overloaded network elements, e...
Erol Basturk, Alexander Birman, G. Delp, Roch Gu&e...
WDAG
1997
Springer
92views Algorithms» more  WDAG 1997»
14 years 1 months ago
Heartbeat: A Timeout-Free Failure Detector for Quiescent Reliable Communication
Abstract. We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with p...
Marcos Kawazoe Aguilera, Wei Chen, Sam Toueg
ICALP
1989
Springer
14 years 1 months ago
Causal Trees
Category theory has been successfully employed to structure the confusing setup of models and equivalences for concurrency: Winskel and Nielsen have related the standard models nc...
Philippe Darondeau, Pierpaolo Degano
SOUPS
2010
ACM
14 years 27 days ago
A closer look at recognition-based graphical passwords on mobile devices
Graphical password systems based on the recognition of photographs are candidates to alleviate current over-reliance on alphanumeric passwords and PINs. However, despite being bas...
Paul Dunphy, Andreas P. Heiner, N. Asokan
« Prev « First page 1318 / 1396 Last » Next »