Contents of Fundamenta Informaticae Volume 55.

Number 1, April 2003
Number 2, April-May 2003
Number 3-4, May-June 2003

Contents of Volume 55, Number 1, April 2003

Click on title for abstract

Deciding whether the frontier of a regular tree is scattered
Stephen L. Bloom and Zoltán Ésik 

Theoretical study and implementation of the canonical automaton
Jean-Marc Champarnaud and Fabien Coulon 

On the Classification and Aggregation of Hierarchies with Different Constitutive Elements
Liviu P. Dinu 

Compressible Infinite Information Systems
Mikhail Ju. Moshkov 

A Fixpoint Semantics and an SLD-Resolution Calculus for Modal Logic Programs
Linh Anh Nguyen

Contents of Volume 55, Number 2, April-May 2003

Click on title for abstract


 Hans-Dieter Burkhard, Ludwik Czaja

Petri nets and resource bisimulation
Vladimir A. Bashkin and Irina A. Lomazova 

N-axioms Parallel Unification
Marco Bellia and M. Eugenia Occhiuto  

Modelling with Hierarchical Object Petri Nets
Berndt Farwer and Kundan Misra 

Synthesis of Petri Net Models: A Rough Set Approach 
Krzysztof Pancerz and Zbigniew Suraj

Verifying Epistemic Properties of Multi-agent Systems via Bounded Model Checking
Wojciech Penczek and Alessio Lomuscio 

Using State Equation to Prove Non-Reachability in Timed Petri nets
Louchka Popova-Zeugmann, Matthias Werner and Jan Richling  

Reachability Analysis for Timed Automata Using Partitioning Algorithms
Agata Pó³rola, Wojciech Penczek and Maciej Szreter 

Checking Reachability Properties for Timed Automata via SAT
Bo¿ena Wo¼na, Andrzej Zbrzezny and Wojciech Penczek 

Contents of Volume 55, Number 3-4, May-June 2003

Click on title for abstract

Sequential Versus Parallel Grammar Formalisms with Respect to Measures of Descriptional Complexity
Suna Aydin and Henning Bordihn 

Shadowed Sets and Related Algebraic Structures
Gianpiero Cattaneo and Davide Ciucci 

Deterministic Computations on a PRAM with Static Processor and Memory Faults
Bogdan S. Chlebus, Leszek G±sieniec and Andrzej Pelc 

Untraceable Blind Signature Schemes Based on Discrete Logarithm Problem
Cheng-Chi Lee, Wei-Pang Yang and Min-Shiang Hwang 

Institution-independent Ultraproducts
Rzvan Diaconescu 

Derived Tree Languages of Nonassociative Lambek Categorial Grammars with Product
Maciej Kandulski 

Extensionality of the RCC8 Composition Table
Sanjiang Li and Mingsheng Ying 

Basic principles for understanding evolutionary algorithms
Karsten Weicker and Nicole Weicker