Sciweavers

5128 search results - page 156 / 1026
» Discrete Component Analysis
Sort
View
HYBRID
2003
Springer
15 years 6 months ago
Automated Symbolic Reachability Analysis; with Application to Delta-Notch Signaling Automata
Abstract. This paper describes the implementation of predicate abstraction techniques to automatically compute symbolic backward reachable sets of high dimensional piecewise affine...
Ronojoy Ghosh, Ashish Tiwari, Claire Tomlin
81
Voted
CDC
2009
IEEE
136views Control Systems» more  CDC 2009»
15 years 4 months ago
Verification of K-step opacity and analysis of its complexity
In this paper, we analyze the verification of K-step opacity in discrete event systems that are modeled as (possibly non-deterministic) finite automata with partial observation on ...
Anooshiravan Saboori, Christoforos N. Hadjicostis
91
Voted
CORR
2010
Springer
96views Education» more  CORR 2010»
15 years 27 days ago
Learning High-Dimensional Markov Forest Distributions: Analysis of Error Rates
The problem of learning forest-structured discrete graphical models from i.i.d. samples is considered. An algorithm based on pruning of the Chow-Liu tree through adaptive threshol...
Vincent Y. F. Tan, Animashree Anandkumar, Alan S. ...
124
Voted
TSE
2002
107views more  TSE 2002»
15 years 13 days ago
Fluid Stochastic Petri Nets Augmented with Flush-Out Arcs: A Transient Analysis Technique
Fluid (or Hybrid) Petri Nets with flush-out arcs are Petri net based models with two classes of places: discrete places that carry a natural number of distinct objects (tokens), a...
Marco Gribaudo, András Horváth
ICCAD
2002
IEEE
124views Hardware» more  ICCAD 2002»
15 years 9 months ago
Interface specification for reconfigurable components
This paper presents a way of encoding some kinds of dynamic reconfiguration behaviour in the interface portion of circuit descriptions. This has many advantages. The user of a rec...
Satnam Singh