Results 1  10
of
189
Efficient Verification of Timed Automata using Dense and Discrete Time Semantics
"... In this paper we argue that the semantic issues of discrete vs. dense time should be separated as much as possible from the pragmatics of statespace representation. Contrary to some misconceptions, the discrete semantics is not inherently bound to use stateexplosive techniques any more than the de ..."
Abstract

Cited by 27 (5 self)
 Add to MetaCart
the dense one. In fact, discrete timed automata can be analyzed using any representation scheme (such as DBM) used for dense time, and in addition can benefit from enumerative andsymbolic techniques (such as BDDs) which are not naturally applicable to dense time. DBMs, on the other hand, can still be used
An Enumerative Approach For Analyzing Time Petri Nets
 Proceedings IFIP
, 1983
"... This paper is concerned with specifying and proving correct systems in which time appears as a parameter. We model such systems via Merlin's Time Petri Nets. An enumerative analysis technique is introduced for these nets based on the computation of a set of state classes and a reachability rela ..."
Abstract

Cited by 83 (5 self)
 Add to MetaCart
This paper is concerned with specifying and proving correct systems in which time appears as a parameter. We model such systems via Merlin's Time Petri Nets. An enumerative analysis technique is introduced for these nets based on the computation of a set of state classes and a reachability
TINA: Analog Placement Using Enumerative Techniques Capable of . . .
, 1996
"... In this paper a new enumerative algorithm called RAF3 is introduced that generates slicing placements optimal in both area and overall net length. It is designed to automate the task of placement for analog circuits given a set of modules with multiple realizations, a corresponding net list, and nei ..."
Abstract
 Add to MetaCart
In this paper a new enumerative algorithm called RAF3 is introduced that generates slicing placements optimal in both area and overall net length. It is designed to automate the task of placement for analog circuits given a set of modules with multiple realizations, a corresponding net list
Enumerative geometry of CalabiYau 4folds
, 2007
"... GromovWitten theory is used to define an enumerative geometry of curves in CalabiYau 4folds. The main technique is to find exact solutions to moving multiple cover integrals. The resulting invariants are analogous to the BPS counts of Gopakumar and Vafa for CalabiYau 3folds. We conjecture the 4 ..."
Abstract

Cited by 28 (10 self)
 Add to MetaCart
GromovWitten theory is used to define an enumerative geometry of curves in CalabiYau 4folds. The main technique is to find exact solutions to moving multiple cover integrals. The resulting invariants are analogous to the BPS counts of Gopakumar and Vafa for CalabiYau 3folds. We conjecture
Symbolic Controller Synthesis for Discrete and Timed Systems
 Hybrid Systems II, LNCS 999
, 1995
"... . This paper presents algorithms for the symbolic synthesis of discrete and realtime controllers. At the semantic level the controller is synthesized by finding a winning strategy for certain games defined by automata or by timedautomata. The algorithms for finding such strategies need, this way o ..."
Abstract

Cited by 133 (16 self)
 Add to MetaCart
variables. Although in the worst case such methods are as bad as enumerative ones, many huge practical problems can be treated by finetuned symbolic methods. In this paper the scope of these methods is extended from analysis to synthesis and from purely discrete systems to realtime systems. We believe
Real Enumerative Geometry and Effective Algebraic Equivalence
 J. Pure Appl. Algebra
, 1996
"... We study when a problem in enumerative geometry may have all of its solutions be real and show that many Schuberttype enumerative problems on some flag manifolds can have all of their solutions be real. Our particular focus is how to use the knowledge that one problem can have all its solutions be ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
be real to deduce that other, related problems do as well. The primary technique is to study deformations of intersections of subvarieties into simple cycles. These methods may also be used to give lower bounds on the number of real solutions that are possible for a given enumerative problem.
Hierarchical Enumerative Coding and Its Applications in Image Compressing
"... A central problem in image compression is the nonstationarity of the input data. Most image compression methods model the image as a stationary source, and the performance of these methods deteriorates significantly in nonstationary areas such as edges. Another important issue in compression is the ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
characteristics is presented. The method is based on a universal compression technique called enumerative coding. The results of the experiments on computergenerated data prove this insensitivity. A detailed computational complexity analysis shows that the method has reasonable computational complexity
Error Propagation Assessment of Enumerative Coding Schemes
 Proc. IEEE International Conference on Communications 2
, 1999
"... Introduction The technique of enumerative coding [1] makes it possible to translate source words into codewords and vice versa by invoking an algorithmic procedure rather than performing the translation with a lookup table. The usage of long codewords makes it possible to approach a code rate whic ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Introduction The technique of enumerative coding [1] makes it possible to translate source words into codewords and vice versa by invoking an algorithmic procedure rather than performing the translation with a lookup table. The usage of long codewords makes it possible to approach a code rate
NonEnumerative Path Delay Fault Diagnosis
 in Proc. Design, Automation and Test in Europe
, 2003
"... The first nonenumerative framework for diagnosing path delay faults using zero suppressed binary decision diagrams is introduced. We show that fault free path delay faults with a validated nonrobust test may together with fault free robustly tested faults be used to eliminate faults from the set o ..."
Abstract
 Add to MetaCart
The first nonenumerative framework for diagnosing path delay faults using zero suppressed binary decision diagrams is introduced. We show that fault free path delay faults with a validated nonrobust test may together with fault free robustly tested faults be used to eliminate faults from the set
Results 1  10
of
189