Sciweavers

7064 search results - page 282 / 1413
» From States to Histories
Sort
View
FSTTCS
1998
Springer
15 years 11 months ago
Partial Order Reductions for Bisimulation Checking
Partial order methods have been introduced to avoid the state explosion problem in veri cation resulting from the representation of multiple interleavings of concurrent transitions...
Michaela Huhn, Peter Niebert, Heike Wehrheim
FGR
1996
IEEE
100views Biometrics» more  FGR 1996»
15 years 11 months ago
Recovering the Temporal Structure of Natural Gesture
A method for the recovery of the temporal structure and phasesin natural gesture is presented. The work is motivated by recent developments in the theory of natural gesture which ...
Andrew D. Wilson, Aaron F. Bobick, Justine Cassell
ASE
2010
126views more  ASE 2010»
15 years 6 months ago
Generating a checking sequence with a minimum number of reset transitions
Given a finite state machine M, a checking sequence is an input sequence that is guaranteed to lead to a failure if the implementation under test is faulty and has no more states t...
Robert M. Hierons, Hasan Ural
CORR
2010
Springer
109views Education» more  CORR 2010»
15 years 6 months ago
Fast simulation of large-scale growth models
We give an algorithm that computes the final state of certain growth models without computing all intermediate states. Our technique is based on a "least action principle"...
Tobias Friedrich, Lionel Levine
ENTCS
2006
151views more  ENTCS 2006»
15 years 6 months ago
Stochastic Simulation Methods Applied to a Secure Electronic Voting Model
We demonstrate a novel simulation technique for analysing large stochastic process algebra models, applying this to a secure electronic voting system example. By approximating the...
Jeremy T. Bradley, Stephen T. Gilmore