Fundamenta Informaticae, Volume 29

Volume 29, Numbers 1-2, January 1997

Günter Hotz, Gisela Pitsch: On Using Semi-Dyck Sets to Analyse Coupled-Context-Free Languages. 1-26
Piotr Dembinski: Semantics of Times Concurrent Systems. 27-50
Jos C. M. Baeten, Jan A. Bergstra: Discrete Time Process Algebra: Absolute Time, Relative Time and Parametric Time. 51-76
Zbigniew Huzar, Jan Magott: Syntax and Semantics of Real-Time and Performance Evaluation Extensions of Specification Language LOTOS. 77-96
Anthony Karel Seda: Quasi-Metrics and the Semantics of Logic Programs. 97-117
Ivo Düntsch, Günther Gediga: Algebraic Aspects of Attribute Dependencies in Information Systems. 119-133
James F. Peters III: Mechanization of Real-Time Linear CSP with Higher Order Logic. 135-163
Uwe Egly: On Definitional Transformations to Normal Form for Institionistic Logic. 165-201

Francis Alexandre, Khaled Bsaïes: A Methodology for Constructing Logic Programs. 203-223
Christel Baier, Mila E. Majster-Cederbaum: How to Interpret and Establish Consistency Results for Semantics of Concurrent Programming Languages. 225-256
Markus Mohnen: A Compiler Correctness Proof for the Static Link Technique by Means of Evolving Algebras. 257-303

Andrzej Ehrenfeucht, Grzegorz Rozenberg, Kai Salomaa: Semantics of Nonsequential Tree-Based Computation Schemes. 305-324
Emanuela Fachini, Angelo Monti: Chomsky Hierarchy and Systolic Y-Tree Automata. 325-339
Gian Luigi Ferrari: Atomicity and Concurrency Control in Process Calculi. 341-368
Jouni Järvinen: A Representation of Dependence Spaces and Some Basic Algorithms. 369-382
Sukhamay Kundu, Jianhua Chen: A New Method of Circumscribing Beliefs: The Propositional Case. 383-390