Results 1  10
of
781,067
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 760 (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
Rational Partial StateGraph Search
, 1993
"... . The AI technique of searching through trees or graphs of neighboring states in a statespace has been used for many years in gameplaying and problem solving domains. For many of these domains, the statespaces are too large to search completely; there is only time for a partial statespace s ..."
Abstract
 Add to MetaCart
. The AI technique of searching through trees or graphs of neighboring states in a statespace has been used for many years in gameplaying and problem solving domains. For many of these domains, the statespaces are too large to search completely; there is only time for a partial state
Iterative Refinement and Condensation for Stategraph Construction
, 1998
"... The traditional technique to generate a global stategraph representation for a concurrent system is to calculate the product of stategraph representations of the local processes. We develop new techniques, and prove their correctness, to help condensing intermediate stategraphs in the iterative p ..."
Abstract
 Add to MetaCart
explicitly or implicitly, for modelchecking is difficult because global stategraph construction can easily grow out of memory space, even when the local process representations are simple[1, 4, 14]. We propose a framework to construct global stategraphs by iteratively composing local process
Pregel: A system for largescale graph processing
 IN SIGMOD
, 2010
"... Many practical computing problems concern large graphs. Standard examples include the Web graph and various social networks. The scale of these graphs—in some cases billions of vertices, trillions of edges—poses challenges to their efficient processing. In this paper we present a computational model ..."
Abstract

Cited by 492 (0 self)
 Add to MetaCart
model suitable for this task. Programs are expressed as a sequence of iterations, in each of which a vertex can receive messages sent in the previous iteration, send messages to other vertices, and modify its own state and that of its outgoing edges or mutate graph topology. This vertexcentric approach
StateGraph – A Modelica Library for Hierarchical State Machines Abstract
"... The new library Modelica.StateGraph is a free Modelica package providing components to model discrete event and reactive systems in a convenient way. It has a similar modeling power as Statecharts, but avoids some deficiencies of Statecharts by using elements of JGrafchart and by using Modelica as a ..."
Abstract

Cited by 24 (2 self)
 Add to MetaCart
The new library Modelica.StateGraph is a free Modelica package providing components to model discrete event and reactive systems in a convenient way. It has a similar modeling power as Statecharts, but avoids some deficiencies of Statecharts by using elements of JGrafchart and by using Modelica
A theory of timed automata
, 1999
"... Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of ..."
Abstract

Cited by 2650 (32 self)
 Add to MetaCart
of realtime systems whose correctness depends on relative magnitudes of different delays. Consequently, timed automata [7] were introduced as a formal notation to model the behavior of realtime systems. Its definition provides a simple way to annotate statetransition graphs with timing constraints
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 674 (15 self)
 Add to MetaCart
; state of the root nodes to 0.9, and we utilized the noisyOR model for the other nodes with a small (0.1) inhibition probability (apart from the leak term, which we inhibited with probability 0.9). This param eterization has the effect of propagating 1 's from the top layer to the bottom. Thus
Retiming Synchronous Circuitry
 ALGORITHMICA
, 1991
"... This paper describes a circuit transformation called retiming in which registers are added at some points in a circuit and removed from others in such a way that the functional behavior of the circuit as a whole is preserved. We show that retiming can be used to transform a given synchronous circui ..."
Abstract

Cited by 376 (3 self)
 Add to MetaCart
circuit into a more efficient circuit under a variety of different cost criteria. We model a circuit as a graph in which the vertex set Visa collection of combinational logic elements and the edge set E is the set of interconnections, each of which may pass through zero or more registers. We give an 0(V
ModelChecking in Dense Realtime
 INFORMATION AND COMPUTATION
, 1993
"... Modelchecking is a method of verifying concurrent systems in which a statetransition graph model of the system behavior is compared with a temporal logic formula. This paper extends modelchecking for the branchingtime logic CTL to the analysis of realtime systems, whose correctness depends on t ..."
Abstract

Cited by 326 (7 self)
 Add to MetaCart
Modelchecking is a method of verifying concurrent systems in which a statetransition graph model of the system behavior is compared with a temporal logic formula. This paper extends modelchecking for the branchingtime logic CTL to the analysis of realtime systems, whose correctness depends
Modelchecking for Probabilistic Realtime Systems
 In Automata, Languages and Programming: Proceedings of the 18th ICALP, Lecture Notes in Computer Science 510
, 1991
"... Modelchecking is a method of verifying concurrent systems in which a stategraph model of the system behavior is compared with a temporal logic formula. This paper extends modelchecking to stochastic realtime systems, whose behavior depends on probabilistic choice and quantitative time. The specif ..."
Abstract

Cited by 105 (12 self)
 Add to MetaCart
Modelchecking is a method of verifying concurrent systems in which a stategraph model of the system behavior is compared with a temporal logic formula. This paper extends modelchecking to stochastic realtime systems, whose behavior depends on probabilistic choice and quantitative time
Results 1  10
of
781,067