Foundations of Software Science and Computation Structures: First International Conference, FoSSaCS'98, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS'98, Lisbon, Portugal, March 28 - April 4, 1998, Pr / Edition 1

by Maurice Nivat

Overview

This book constitutes the refereed proceedings of the First International Conference on the Foundations of Software Science and Computation Structures, FoSSaCS'98, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS'98, in Lisbon, Portugal, in March/April 1998.

The 19 revised full papers presented in the book were carefully selected from a total of 44 submissions. Among the topics covered are formal specification, automata theory, term rewriting and rewriting systems, process algebras, formal language theory, type theory, event structures, and iteration theory.

Product Details

ISBN-13:	9783540643005
Publisher:	Springer Berlin Heidelberg
Publication date:	04/24/1998
Series:	Lecture Notes in Computer Science , #1378
Edition description:	1998
Pages:	297
Product dimensions:	6.10(w) x 9.25(h) x 0.03(d)

Table of Contents

Generalizing domain theory.- A cook's tour of equational axiomatizations for prefix iteration.- The WHILE hierarchy of program schemes is infinite.- Analysis of a guard condition in type theory.- An event structure semantics for P/T contextual nets: Asymmetric event structures.- Pumping Lemmas for timed automata.- Asynchronous Observations of Processes.- Minor searching, normal forms of graph relabelling: Two applications based on enumerations by graph relabelling.- Partial metrics and co-continuous valuations.- Mobile ambients.- Rational term rewriting.- The appearance of big integers in exact real arithmetic based on Linear Fractional Transformations.- Net refinement by pullback rewriting.- On piecewise testable, starfree, and recognizable picture languages.- Functor categories and two-level languages.- Deciding properties for message sequence charts.- The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages.- Deterministic rational transducers and random sequences.- Resource based models for asynchrony.