Sciweavers

IJFCS
2006
110views more  IJFCS 2006»
13 years 9 months ago
Sat-based Model Checking for Region Automata
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...
Fang Yu, Bow-Yaw Wang
IJFCS
2006
58views more  IJFCS 2006»
13 years 9 months ago
Covering of Transient Simulation of Feedback-free Circuits by Binary Analysis
Transient simulation of a gate circuit is an efficient method of counting signal changes occurring during a transition of the circuit. It is known that this simulation covers the ...
Yuli Ye, Janusz A. Brzozowski
IJFCS
2006
82views more  IJFCS 2006»
13 years 9 months ago
Routing Multiple Width Communications on the Circuit Switched Tree
Dynamically reconfigurable architectures offer extremely fast solutions to various problems. The Circuit Switched Tree (CST) is an important interconnect used to implement such ar...
Krishnendu Roy, Ramachandran Vaidyanathan, Jerry L...
IJFCS
2006
119views more  IJFCS 2006»
13 years 9 months ago
Enforcing Concurrent Temporal Behaviors
The outcome of verifying software is often a `counterexample', i.e., a listing of the actions and states of a behavior not satisfying the specification. In order to understan...
Doron Peled, Hongyang Qu
IJFCS
2006
77views more  IJFCS 2006»
13 years 9 months ago
Spike Trains in Spiking Neural P Systems
We continue here the study of the recently introduced spiking neural P systems, which mimic the way that neurons communicate with each other by means of short electrical impulses, ...
Gheorghe Paun, Mario J. Pérez-Jiméne...
IJFCS
2006
132views more  IJFCS 2006»
13 years 9 months ago
Generalized Lr Parsing Algorithm for Boolean Grammars
The generalized LR parsing algorithm for context-free grammars is extended for the case of Boolean grammars, which are a generalization of the context-free grammars with logical c...
Alexander Okhotin
IJFCS
2006
106views more  IJFCS 2006»
13 years 9 months ago
A Timed Failure Equivalence Preserving Abstraction for Parametric Time-interval Automata
ion for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, Graduate School of Information Science...
Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teru...
IJFCS
2006
94views more  IJFCS 2006»
13 years 9 months ago
Conflicts and Fair Testing
This paper studies conflicts from a process-algebraic point of view and shows how they are related to the testing theory of fair testing. Conflicts have been introduced in the con...
Robi Malik, David Streader, Steve Reeves
IJFCS
2006
81views more  IJFCS 2006»
13 years 9 months ago
Combinatorial Properties of Sturmian Palindromes
We study some structural and combinatorial properties of Sturmian palindromes, i.e., palindromic finite factors of Sturmian words. In particular, we give a formula which permits t...
Aldo de Luca, Alessandro De Luca
IJFCS
2006
111views more  IJFCS 2006»
13 years 9 months ago
Completeness and realizability: conditions for automatic generation of workflows
In recent years, workflow technology has greatly facilitated business process modeling and reengineering in information systems. On one hand, the separation of an application'...
Shiyong Lu, Arthur J. Bernstein, Philip M. Lewis