Sciweavers

575 search results - page 7 / 115
» Model Checking Restricted Sets of Timed Paths
Sort
View
PAPM
2001
Springer
126views Mathematics» more  PAPM 2001»
13 years 11 months ago
Beyond Memoryless Distributions: Model Checking Semi-Markov Chains
Abstract. Recent investigations have shown that the automated verification of continuous-time Markov chains (CTMCs) against CSL (Continuous Stochastic Logic) can be performed in a...
Gabriel G. Infante López, Holger Hermanns, ...
ICML
2009
IEEE
14 years 8 months ago
Factored conditional restricted Boltzmann Machines for modeling motion style
The Conditional Restricted Boltzmann Machine (CRBM) is a recently proposed model for time series that has a rich, distributed hidden state and permits simple, exact inference. We ...
Graham W. Taylor, Geoffrey E. Hinton
JMLR
2010
169views more  JMLR 2010»
13 years 2 months ago
Factored 3-Way Restricted Boltzmann Machines For Modeling Natural Images
Deep belief nets have been successful in modeling handwritten characters, but it has proved more difficult to apply them to real images. The problem lies in the restricted Boltzma...
Marc'Aurelio Ranzato, Alex Krizhevsky, Geoffrey E....
FUIN
2007
116views more  FUIN 2007»
13 years 7 months ago
Path Compression in Timed Automata
The paper presents a method of abstraction for timed systems. To extract an abstract model of a timed system we propose to use static analysis, namely a technique called path compr...
Agata Janowska, Wojciech Penczek
SCP
2010
155views more  SCP 2010»
13 years 5 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay