Sciweavers

28 search results - page 4 / 6
» ijfcs 2008
Sort
View
IJFCS
2008
121views more  IJFCS 2008»
13 years 9 months ago
Reachability Problems in Low-Dimensional Iterative Maps
In this paper we analyse the dynamics of one-dimensional piecewise maps (PAMs). We show that one-dimensional PAMs are equivalent to pseudo-billiard or so called "strange billi...
Oleksiy Kurganskyy, Igor Potapov, Fernando Sancho-...
IJFCS
2008
81views more  IJFCS 2008»
13 years 9 months ago
Reachability Analysis in Verification via Supercompilation
Abstract. We present an approach to verification of parameterized systems, which is based on program transformation technique known as supercompilation. In this approach the statem...
Alexei Lisitsa, Andrei P. Nemytykh
IJFCS
2008
108views more  IJFCS 2008»
13 years 9 months ago
Basic Algorithm for Attribute Implications and Functional Dependencies in Graded Setting
We present GLinClosure, a graded extension of the well-known LinClosure algorithm. GLinClosure can be used to compute degrees of semantic entailment from sets of fuzzy attribute i...
Radim Belohlávek, Vilém Vychodil
IJFCS
2008
110views more  IJFCS 2008»
13 years 9 months ago
Indexing Gapped-Factors Using a Tree
We present a data structure to index a specific kind of factors, that is of substrings, called gapped-factors. A gapped-factor is a factor containing a gap that is ignored during ...
Pierre Peterlongo, Julien Allali, Marie-France Sag...
IJFCS
2008
166views more  IJFCS 2008»
13 years 9 months ago
Decidability and Complexity Analysis of Forbidden State Problems for Discrete Event Systems
The conventional forbidden state problem for discrete event systems is concerned with the issue of synthesizing a maximally permissive control policy to prevent a discrete event s...
Hsu-Chun Yen