Results 1 - 10 of 33,051

Table 1: HeterTrust - comparison with other deterministic state machine replication protocols Protocol SM FM n e a Msg. complexity Latency Confid. Crypt.

in The Fail-Heterogeneous Architectural Model ∗
by unknown authors
"... In PAGE 2: ... Our ap- proach differs from this as it binds failure modes to specific nodes based on their design. Table1 presents a comparison between HeterTrust and other deterministic state machine replication protocols. Most of the compared protocols assume partially syn- chronous system models similar to [11], except [9] where a Wormhole model is assumed.... In PAGE 3: ...3. Table1 also indicates the type of cryptography used during normal operation in the critical path. All mentioned fail- Byzantine protocols use public keys during recovery.... ..."

Table 2.1: Systems for secure state machine replication (Fleet supports only loose coordi- nation, but not state machine replication directly). All systems achieve optimal resilience t lt; n=3. The column entitled \BA? quot; notes if a system solves Byzantine agreement (BA); those who do build (1) on an (assumed) atomic broadcast protocol, (2) on randomization and threshold signatures, (3) on a failure detector or \muteness detector quot; in the Byzantine model, or (4) on a cryptographic coin [12] in the underlying Byzantine agreement proto- col. Some systems need a failure detector (FD); all except Total need a trusted dealer for setup. Fleet can also tolerate adversaries of Byzantine Quorum systems, our system tolerates general Q3-adversaries.

in Project IST-1999-11583
by Malicious- And Accidental-Fault, Christian Cachin (editor, Joy Algesheimer, Christian Cachin, Christian Cachin, Klaus Kursawe, Frank Petzold, Jonathan A. Poritz, Victor Shoup, Michael Waidner

Table 3 States of the replicated module

in The modelling process and Petri Nets: reasoning on different approaches
by N. Mazzocca, S. Russo, V. Vittorini
"... In PAGE 6: ... Each component of our system is a non-terminating process: it is activated once and iteratively returns to its initial state after a nite sequence of state transitions. Table3 summarizes both the informal description and formal de nition of the states of the replicated module. A feasible state S of a process P is de ned by means of the subset of the events which cause the transition of the related component in the state S.... In PAGE 6: ... A feasible state S of a process P is de ned by means of the subset of the events which cause the transition of the related component in the state S. For example, the de nition of the state compute on the rst row of Table3 , says that either compute is the initial state at the activation of the process ( lt; gt; is the empty trace) or it is determined by the occurrence of one of the events s apos; belonging to the subset E10S; E11S; E12S. Internal and external assumptions are the last information of the system informal description... ..."

Table 2. States of the replicated component

in Integrating Trace Logic and Petri Nets Specifications
by Nicola Mazzocca, Stefano Russo, Valeria Vittorini
"... In PAGE 5: ... tr.2: Look for the empty trace among the states formal den0cnitions in Table2 . The related state is n5ccom- pute quot;.... In PAGE 5: ... tr.3: E1S is the n0crst event of the trace, look for E1S in Table2 . The related state is n5ccheck quot;.... ..."

Table 1. State machine

in An approach for designing on-line testable state machines
by P. K. Lala, M. G. Karpovsky
"... In PAGE 3: ...dentical i.e. there is no state change produced by an input, the state bits in Q are not deactivated. Let us illustrate the proposed approach by designing the state machine ( an MCNC benchmark circuit ) specified in Table1 . We consider only the next states, the inclusion of the output logic is straightforward.... ..."

TABLE IV MACHINE STATE

in Retargetable Pipeline Hazard Detection for Partially Bypassed Processors
by Aviral Shrivastava, Eugene Earlie, Nikil Dutt, Alex Nicolau 2006
Cited by 1

Table 8: RIs replicating state of the application groups

in Flexible and Transparent Fault Tolerance for Distributed Object-Oriented Applications
by Universitt Karlsruhe, Dietmar A. Kottmann, Prof Dr, Alexander B. Schill, Interner Bericht

Table 7. Abstract State Machines

in The Varieties of Programming Language Semantics And Their Uses
by Peter D. Mosses 2001
"... In PAGE 11: ... a3 States include control-flow graphs representing the entire program. In the fragment shown in Table7 , the functions fst, nxt represent normal control flow between phrases. However, flow of control need not follow the structure of the program at all: in principle, the pointer task, normally indicating the next part of the program to be executed, can be set arbitrarily.... In PAGE 11: ... However, flow of control need not follow the structure of the program at all: in principle, the pointer task, normally indicating the next part of the program to be executed, can be set arbitrarily. The control-flow graph itself is static, but computed values can be associated with nodes by a separate dynamic function, such as val in Table7 . Scopes of bindings are represented indirectly, by explicit stacking of values, rather than by using environments or syntactic substitution.... ..."
Cited by 1

Table 2: Edgebreaker state machine.

in Edgebreaker: A Simple Compression for Surfaces with Handles
by Jarek Rossignac, Helio Lopes, Alla Safanova, Geovan Tavares, Andrzej Szymczak 2002
"... In PAGE 5: ... When the tip of the new triangle has been visited, we distinguish four other cases, based on the status of the neighboring (left and right) triangles. They correspond to the labels L, R, E and S as indicated in Table2 . To test whether the left and right adjacent triangles have been visited we use, respectively, the commands ( IF c.... ..."
Cited by 12

Table 2: Initial State Machine

in unknown title
by unknown authors
Results 1 - 10 of 33,051