Fundamenta Informaticae, Volume 62

Volume 62, Number 1, 2004

• Boris A. Trakhtenbrot:
  Preface.
  Electronic Edition (link) BibTeX
• Yoram Hirshfeld, Alexander Moshe Rabinovich:
  Logics for Real Time: Decidability and Complexity. 1-28
  Electronic Edition (link) BibTeX
• Anatol Slissenko:
  A Logic Framework for Verification of Timed Algorithms. 29-67
  Electronic Edition (link) BibTeX
• Boris A. Trakhtenbrot:
  Understanding Basic Automata Theory in the Continuous Time Setting. 69-121
  Electronic Edition (link) BibTeX
• D. Pardo, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot:
  Synchronous Circuits over Continuous Time: Feedback Reliability and mpleteness. 123-137
  Electronic Edition (link) BibTeX

Volume 62, Number 2, 2004

• Ryszard Janicki:
  Preface.
  Electronic Edition (link) BibTeX
• Yves Bontemps, Pierre-Yves Schobbens, Christof Löding:
  Synthesis of Open Reactive Systems from Scenario-Based Specifications. 139-169
  Electronic Edition (link) BibTeX
• Jordi Cortadella, Alex Kondratyev, Luciano Lavagno, Alexander Taubin, Yosinori Watanabe:
  Quasi-static Scheduling for Concurrent Architectures. 171-196
  Electronic Edition (link) BibTeX
• Javier Esparza:
  A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs. 197-220
  Electronic Edition (link) BibTeX
• Victor Khomenko, Maciej Koutny, Alexandre Yakovlev:
  Detecting State Encoding Conflicts in STG Unfoldings Using SAT. 221-241
  Electronic Edition (link) BibTeX
• Jean-Pierre Talpin, Paul Le Guernic, Sandeep K. Shukla, Frederic Doucet, Rajesh K. Gupta:
  Formal Refinement Checking in a System-level Design Methodology. 243-273
  Electronic Edition (link) BibTeX

Volume 62, Number 3-4, 2004

• Chin-Chen Chang, Piyu Tsai, Min-Hui Lin:
  An Adaptive Steganographic Scheme for Color Images. 275-289
  Electronic Edition (link) BibTeX
• Franck Cassez, Claire Pagetti, Olivier H. Roux:
  A Timed Extension for ALTARICA. 291-332
  Electronic Edition (link) BibTeX
• Olivier Finkel:
  An omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank. 333-342
  Electronic Edition (link) BibTeX
• Chris A. Johnson:
  Query Compilation under the disjunctive well-founded semantics. 343-368
  Electronic Edition (link) BibTeX
• Marek Karpinski, Miroslaw Kowaluk, Andrzej Lingas:
  Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs. 369-375
  Electronic Edition (link) BibTeX
• Paolo Liberatore, Marco Schaerf:
  The Compactness of Belief Revision and Update Operators. 377-393
  Electronic Edition (link) BibTeX
• Jacek Marciniec:
  Optimal Unification of Infinite Sets of Types. 395-407
  Electronic Edition (link) BibTeX
• Supriya Kumar De:
  A Rough Set Theoretic Approach to Clustering. 409-417
  Electronic Edition (link) BibTeX