Filters








1,640 Hits in 3.2 sec

Unreliable Failure Detectors via Operational Semantics [chapter]

Uwe Nestmann, Rachele Fuzzati
2003 Lecture Notes in Computer Science  
In this paper, we provide a fresh look at failure detectors from the point of view of programming languages, more precisely using the formal tool of operational semantics.  ...  Using operational semantics, we prove formally that representations of failure detectors in the new model are equivalent to their original representations within the model used by Chandra and Toueg.  ...  Acknowledgments We very much thank André Schiper and Sam Toueg for enlightening discussions about failure detectors and, more generally, distributed algorithms, but they may not necessarily agree with  ... 
doi:10.1007/978-3-540-40965-6_5 fatcat:x74owerpvffa3k5ppgg5rjaxyu

Model Checking a Modular-Structured Nonblocking Atomic Commitment Protocol for Asynchronous Distributed Systems

Eun-Hye Choi, Keishi Okamoto, Tatsuhiro Tsuchiya, Tohru Kikuno
2009 2009 Software Technologies for Future Dependable Distributed Systems  
failure detectors should provide are guaranteed.  ...  In the proposed method, we first construct a model for the NBAC protocol in a modular way by composing a behavior model for unreliable failure detector and a behavior model for distributed computing nodes  ...  Failure detectors are unreliable because they can suspect an operational node or not suspect a failed node.  ... 
doi:10.1109/stfssd.2009.34 fatcat:spn3zszarjdz7nximb2w2rta4a

Dynamic IoT Choreographies [article]

Jan Seeger, Rohit A. Deshmukh, Vasil Sarafov, Arne Bröring
2019 arXiv   pre-print
In [10] , De Moraes Rosetto et al. present the design of an unreliable failure detector for ubiquitous environments, which supports grouping and assigning of different impact factors of nodes.  ...  [1] ) and enables the creation of choreographies from recipes, a semantic database for persistence and semantic operations and finally the engine.  ... 
arXiv:1803.03190v4 fatcat:cp2rqp2psbesnhfwa43eopfnsa

Page 97 of IEEE Transactions on Computers Vol. 52, Issue 2 [page]

2003 IEEE Transactions on Computers  
Fetzer advances the concept of unreliable failure detectors to timed asynchronous systems by enforcing perfect failure detection with hard- ware watchdogs.  ...  Murray in , in Time-Triggered Distributed Systems” propose a con- structive approach to integrate runtime recovery policies so that a processor recovering from task failures does not disrupt the operation  ... 

Synchrony and Time in Fault-Tolerant Distributed Algorithms [chapter]

Ulrich Schmid
2010 Lecture Notes in Computer Science  
detector ◊P: • Failure semantics ranging from -Crash failures: Processors stops operating, possibly in a step -Byzantine failures [LSP82]: Processors can do what they want • Communication between  ...  Schmid: Sync and Time in FT Distributed Algorithms 20 September 8, 2010 Failure Detectors [CT96] (I) • Chandra & Toueg augmented purley asynchronous systems with (unreliable) failure detectors (FDs  ... 
doi:10.1007/978-3-642-15297-9_5 fatcat:as755mkxsffwvowk5xdz4mnhou

Failure Detection with Booting in Partially Synchronous Systems [chapter]

Josef Widder, Gérard Le Lann, Ulrich Schmid
2005 Lecture Notes in Computer Science  
Unreliable failure detectors are a well known means to enrich asynchronous distributed systems with time-free semantics that allow to solve consensus in the presence of crash failures.  ...  Implementing unreliable failure detectors requires a system that provides some synchrony, typically an upper bound on end-to-end message delays.  ...  A different -more abstract -approach was taken by Chandra and Toueg [5, 6] , who introduced the concept of unreliable failure detectors (FDs).  ... 
doi:10.1007/11408901_3 fatcat:ln5w6eafpjgt7i26b2wxmxfy4q

States in Process Calculi

Christoph Wagner, Uwe Nestmann
2014 Electronic Proceedings in Theoretical Computer Science  
use domain-specific variants of the latter, as they are convenient modeling languages in which the local code of processes can be programmed explicitly, with the local state information usually managed via  ...  We extract from congruence classes of reachable states individual state-informative representatives that we supply with a proper formal semantics.  ...  To detect crashes we need a tool, which we denote as failure detector. We concentrate on unreliable failure detectors as described in [2] .  ... 
doi:10.4204/eptcs.160.6 fatcat:nctoztz3fbaypasd66ym7eyq5u

Advances in the Design and Implementation of Group Communication Middleware [chapter]

Daniel Bünzli, Rachele Fuzzati, Sergio Mena, Uwe Nestmann, Olivier Rütti, André Schiper, Paweł T. Wojciechowski
2006 Lecture Notes in Computer Science  
Group communication is a programming abstraction that allows a distributed group of processes to provide a reliable service in spite of the possibility of failures within the group.  ...  The section proposes a fresh look at failure detectors by representing them via transition systems (as known from operational semantics), with the goal of bringing the definitions closer to our formal  ...  The concept of unreliable failure detectors has been introduced some time ago.  ... 
doi:10.1007/11808107_8 fatcat:zy6loymyyje5fbun5zhwghru7q

On Process-Algebraic Proof Methods for Fault Tolerant Distributed Systems [chapter]

Morten Kühnrich, Uwe Nestmann
2009 Lecture Notes in Computer Science  
In settings with process failures, things get worse.  ...  The wrap code has to use perfect failure detectors since unreliable failure detectors may cause incorrect answers. For convenience, let R def = {a i,j,k , b i,j , c i } 1≤i,j,k≤n .  ...  Our own previous work [NFM03] has been in the context of much weaker imperfect (or: unreliable) failure detectors (♦S, as of [CT96] ).  ... 
doi:10.1007/978-3-642-02138-1_13 fatcat:ac6cmzi4yfdrbbr6inywlmtos4

Modular fault handling in a network-transparent programming language

Gery Debongnie, Raphael Collet, Sebastien Doeraene, Peter Van Roy
2012 2012 5th International Workshop on Exception Handling (WEH)  
The failure of an entity is modeled in the system as a language entity, and is visible to the programmer via its corresponding fault stream. We also describe an implementation in Mozart 1.4.0.  ...  The Erlang programming language is network-transparent and handle failures by message passing.  ...  The failure of an entity is modeled in the system as a language entity, and is visible to the programmer via its corresponding fault stream.  ... 
doi:10.1109/weh.2012.6226592 dblp:conf/icse/DebongnieCDR12 fatcat:fnvwhmpkr5cfvps3hwf2l4fqcm

Software-based replication for fault tolerance

R. Guerraoui, A. Schiper
1997 Computer  
For more information, see the "Consensus in Asynchronous Systems with Unreliable Failure Detectors" sidebar, next page.  ...  The view-synchronous paradigm presented later defines the communication semantics that ensure correctness of the primary-backup technique despite an unreliable failure detection mechanism.  ...  Consensus in Asynchronous Systems with Unreliable Failure Detectors We define the consensus problem over set of processes P.  ... 
doi:10.1109/2.585156 fatcat:27pyp6qlt5hujfibvas7sdgecm

Fault-Tolerant Multiparty Session Types (Technical Report) [article]

Kirstin Peters and Uwe Nestmann and Christoph Wagner
2022 arXiv   pre-print
Moreover, we augment the semantics of processes by failure patterns that can be used to represent system requirements (as, e.g., failure detectors).  ...  We extend multiparty session types to cope with system failures such as unreliable communication and process crashes.  ...  In contrast we augment the semantics of the session calculus with failure patterns that e.g. allow to implement failure detectors but may also be used to implement system requirements.  ... 
arXiv:2204.07728v1 fatcat:hgbkexi2nbej5pjs4b6f4kvdja

Modeling Consensus in a Process Calculus [chapter]

Uwe Nestmann, Rachele Fuzzati, Massimo Merro
2003 Lecture Notes in Computer Science  
We give a process calculus model that formalizes a wellknown algorithm (introduced by Chandra and Toueg) solving consensus in the presence of a particular class of failure detectors (♦S); we use our model  ...  It would also be interesting to study extensions of our operational semantics setting for failure detectors towards more dynamic mobile systems.  ...  We use process calculus and operational semantics to justify proofs via global views that are based on the abstraction of rounds.  ... 
doi:10.1007/978-3-540-45187-7_26 fatcat:xog2karnrnfofpahgdwdvbu5uy

Towards a model-driven method for reliable applications

Vidar Slåtten, Frank Alexander Kraemer, Peter Herrmann
2010 Proceedings of the 2nd International Workshop on Software Engineering for Resilient Systems - SERENCE '10  
We present a model-driven method to incrementally introduce fault-tolerance mechanisms into application models that are initially developed with assumptions of ideal transmission semantics.  ...  This means that the transmission between partitions has the semantics described by the building block in Fig. 6 , with a send and receive operation.  ...  It shows that after a token is provided via input node pid, the authentication terminates either via ok or nok.  ... 
doi:10.1145/2401736.2401737 dblp:conf/serene/SlattenKH10 fatcat:m2coby7n6zg4rcd5jutyre3uji

Effective multicast programming in large scale distributed systems

Patrick Th. Eugster, Romain Boichat, Rachid Guerraoui, Joe Sventek
2001 Concurrency and Computation  
The failure detector layer The Channel Failure Detector layer is used to administer a network topology and define the views of reachable subscribers.  ...  The possibility of partial failures can fundamentally change the semantics of an invocation.  ...  Topic channel failure detector Each participant p has access to a local failure detector module which outputs hints about the closed channels of p with other participants.  ... 
doi:10.1002/cpe.584 fatcat:b3cb2iledjaydbspzuxoihi22u
« Previous Showing results 1 — 15 out of 1,640 results