Contents of Fundamenta Informaticae Volume 62.

Number 1, June 2004

Number 2, July 2004

Number 3-4, August 2004

Contents of Volume 62, Number 1, June 2004
Click on title for abstract

Preface

Logics for Real Time: Decidability and Complexity
Yoram Hirshfeld and Alexander Rabinovich

A Logic Framework for Verification of Timed Algorithms
Anatol Slissenko

Understanding Basic Automata Theory in the Continuous Time Setting
B. A. Trakhtenbrot 6

Synchronous Circuits over Continuous Time: Feedback Reliability and Completeness
D. Pardo, A. Rabinovich and B.A. Trakhtenbrot

Contents of Volume 62, Number 2, July 2004
Click on title for abstract

Preface

Synthesis of Open Reactive Systems from Scenario-Based Specifications
Yves Bontemps, Pierre-Yves Schobbens and Christof Löding

Quasi-static Scheduling for Concurrent Architectures
Jordi Cortadella, Alex Kondratyev, Luciano Lavagno, Alexander Taubin and Yosinori Watanabe 

A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs
Javier Esparza

Detecting State Encoding Conflicts in STG Unfoldings Using SAT
Victor Khomenko, Maciej Koutny and Alex Yakovlev

Formal Refinement Checking in a System-level Design Methodology
Jean-Pierre Talpin, Paul Le Guernic, Sandeep Kumar Shukla, Frédéric Doucet and Rajesh Gupta

An Adaptive Steganographic Scheme for Color Images
Chin-Chen Chang, Piyu Tsai and Min-Hui Lin

A Timed Extension for ALTARICA
Franck Cassez, Claire Pagetti and Olivier Roux

An w-Power of a Finitary Language Which is a Borel Set of Infinite Rank
Olivier Finkel

Query compilation under the disjunctive well-founded semantics
Chris A. Johnson

Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs
Marek Karpinski, Miroslaw Kowaluk and Andrzej Lingas

The Compactness of Belief Revision and Update Operators
Paolo Liberatore and Marco Schaerf

Optimal Unification of Infinite Sets of Types
Jacek Marciniec

A Rough Set Theoretic Approach to Clustering
Supriya Kumar De