Sciweavers

IJFCS
2008
81views more  IJFCS 2008»
13 years 11 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
166views more  IJFCS 2008»
13 years 11 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
IJFCS
2008
158views more  IJFCS 2008»
13 years 11 months ago
An Alternative Construction in Symbolic Reachability Analysis of Second Order Pushdown Systems
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...
Anil Seth
IJFCS
2008
108views more  IJFCS 2008»
13 years 11 months ago
On the Computation of the Relative Entropy of Probabilistic Automata
Corinna Cortes, Mehryar Mohri, Ashish Rastogi, Mic...
IJFCS
2008
110views more  IJFCS 2008»
13 years 11 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
102views more  IJFCS 2008»
13 years 11 months ago
Succinct Minimal Generators: Theoretical Foundations and Applications
In data mining applications, highly sized contexts are handled what usually results in a considerably large set of frequent itemsets, even for high values of the minimum support t...
Tarek Hamrouni, Sadok Ben Yahia, Engelbert Mephu N...
IJFCS
2008
130views more  IJFCS 2008»
13 years 11 months ago
Equivalence of Labeled Markov Chains
We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observat...
Laurent Doyen, Thomas A. Henzinger, Jean-Fran&cced...
IJFCS
2008
68views more  IJFCS 2008»
13 years 11 months ago
On Some Combinatorial Problems Concerning the Harmonic Structure of Musical Chord Sequences
Domenico Cantone, Salvatore Cristofaro, Simone Far...
IJFCS
2008
59views more  IJFCS 2008»
13 years 11 months ago
A Survey on Small Fragments of First-Order Logic over Finite Words
Volker Diekert, Paul Gastin, Manfred Kufleitner