Results 1  10
of
155,188
Distributed Snapshots: Determining Global States of Distributed Systems
 ACM TRANSACTIONS ON COMPUTER SYSTEMS
, 1985
"... This paper presents an algorithm by which a process in a distributed system determines a global state of the system during a computation. Many problems in distributed systems can be cast in terms of the problem of detecting global states. For instance, the global state detection algorithm helps to s ..."
Abstract

Cited by 1208 (6 self)
 Add to MetaCart
This paper presents an algorithm by which a process in a distributed system determines a global state of the system during a computation. Many problems in distributed systems can be cast in terms of the problem of detecting global states. For instance, the global state detection algorithm helps
Virtual time and global states of distributed systems.
 Proc. Workshop on Parallel and Distributed Algorithms,
, 1989
"... Abstract A distributed system can be characterized by the fact that the global state is distributed and that a common time base does not exist. However, the notion of time is an important concept in every day life of our decentralized \ r eal world" and helps to solve problems like getting a c ..."
Abstract

Cited by 744 (5 self)
 Add to MetaCart
Abstract A distributed system can be characterized by the fact that the global state is distributed and that a common time base does not exist. However, the notion of time is an important concept in every day life of our decentralized \ r eal world" and helps to solve problems like getting a
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1388 (62 self)
 Add to MetaCart
We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent
Detectability of Discrete Event Systems
"... In this paper, we investigate the detectability problem in discrete event systems. We assume that we do not know initially which state the system is in. The problem is to determine the current and subsequent states of the system based on a sequence of observation. The observation includes partial ev ..."
Abstract

Cited by 806 (14 self)
 Add to MetaCart
In this paper, we investigate the detectability problem in discrete event systems. We assume that we do not know initially which state the system is in. The problem is to determine the current and subsequent states of the system based on a sequence of observation. The observation includes partial
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract

Cited by 758 (41 self)
 Add to MetaCart
Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number
The algorithmic analysis of hybrid systems
 THEORETICAL COMPUTER SCIENCE
, 1995
"... We present a general framework for the formal specification and algorithmic analysis of hybrid systems. A hybrid system consists of a discrete program with an analog environment. We model hybrid systems as nite automata equipped with variables that evolve continuously with time according to dynamica ..."
Abstract

Cited by 778 (71 self)
 Add to MetaCart
to linear hybrid systems. In particular, we consider symbolic modelchecking and minimization procedures that are based on the reachability analysis of an infinite state space. The procedures iteratively compute state sets that are definable as unions of convex polyhedra in multidimensional real space. We
Toward the next generation of recommender systems: A survey of the stateoftheart and possible extensions
 IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
, 2005
"... This paper presents an overview of the field of recommender systems and describes the current generation of recommendation methods that are usually classified into the following three main categories: contentbased, collaborative, and hybrid recommendation approaches. This paper also describes vario ..."
Abstract

Cited by 1490 (23 self)
 Add to MetaCart
This paper presents an overview of the field of recommender systems and describes the current generation of recommendation methods that are usually classified into the following three main categories: contentbased, collaborative, and hybrid recommendation approaches. This paper also describes
Implementing FaultTolerant Services Using the State Machine Approach: A Tutorial
 ACM COMPUTING SURVEYS
, 1990
"... The state machine approach is a general method for implementing faulttolerant services in distributed systems. This paper reviews the approach and describes protocols for two different failure modelsByzantine and failstop. System reconfiguration techniques for removing faulty components and i ..."
Abstract

Cited by 975 (9 self)
 Add to MetaCart
The state machine approach is a general method for implementing faulttolerant services in distributed systems. This paper reviews the approach and describes protocols for two different failure modelsByzantine and failstop. System reconfiguration techniques for removing faulty components
Impulses and Physiological States in Theoretical Models of Nerve Membrane
 Biophysical Journal
, 1961
"... ABSTRACT Van der Pol's equation for a relaxation oscillator is generalized by the addition of terms to produce a pair of nonlinear differential equations with either a stable singular point or a limit cycle. The resulting "BVP model " has two variables of state, representing excitabi ..."
Abstract

Cited by 505 (0 self)
 Add to MetaCart
ABSTRACT Van der Pol's equation for a relaxation oscillator is generalized by the addition of terms to produce a pair of nonlinear differential equations with either a stable singular point or a limit cycle. The resulting "BVP model " has two variables of state, representing
The protection of information in computer systems
"... This tutorial paper explores the mechanics of protecting computerstored information from unauthorized use or modification. It concentrates on those architectural structureswhether hardware or softwarethat are necessary to support information protection. The paper develops in three main sectio ..."
Abstract

Cited by 824 (2 self)
 Add to MetaCart
architecture. It examines in depth the principles of modern protection architectures and the relation between capability systems and access control list systems, and ends with a brief analysis of protected subsystems and protected objects. The reader who is dismayed by either the prerequisites or the level
Results 1  10
of
155,188