Sciweavers

36781 search results - page 153 / 7357
» Parameterizing by the Number of Numbers
Sort
View
RTSS
1996
IEEE
14 years 2 months ago
Reducing the number of clock variables of timed automata
We propose a method for reducing the number of clocks of a timed automaton by combining two algorithms. The first one consists in detecting active clocks, that is, those clocks wh...
Conrado Daws, Sergio Yovine
DSD
2009
IEEE
71views Hardware» more  DSD 2009»
14 years 2 months ago
Representation of Incompletely Specified Index Generation Functions Using Minimal Number of Compound Variables
This paper shows a method to reduce the number of input variables to represent incompletely specified index generation functions. A compound variable is generated by EXORing the o...
Tsutomu Sasao, Takaaki Nakamura, Munehiro Matsuura
CSL
2006
Springer
14 years 2 months ago
Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
Abstract. Expansions of the natural number ordering by unary predicates are studied, using logics which in expressive power are located between first-order and monadic second-order...
Alexander Moshe Rabinovich, Wolfgang Thomas
STACS
1995
Springer
14 years 2 months ago
The Number of Views of Piecewise-Smooth Algebraic Objects
Abstract. A solid object in 3-dimensional space may be described by a collection of all its topologically distinct 2-dimensional appearances, its aspect graph. In this paper, we st...
Sylvain Petitjean
CG
2008
Springer
14 years 23 days ago
About the Completeness of Depth-First Proof-Number Search
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
Akihiro Kishimoto, Martin Müller 0003