This monograph presents a novel execution model for the parallel execution of standard sequential Prolog. In this execution model Prolog procedure calls can be efficiently pipelined, and the author shows how even fully deterministic Prolog programs can be effectively mapped onto the proposed architecture. The design is based on a highly optimized abstract Prolog specific instruction set. A special feature of this work is a sophisticated classification scheme for Prolog variables which substantially reduces the overhead for unification with occur-check. To support the model an architecture consisting of a circular pipeline of independent processors has been designed. This pipeline has been designed to work as a co-processor to a UNIX based workstation. In contrast to other attempts to execute sequential Prolog in parallel, the proposed model does not restrict the use of any of the standard Prolog language features. The book gives a full account of the execution model, the system architecture, and the abstract Prolog instruction set.

The main idea behind the series of volumes Advances in Petri Nets is to present to the general computer science community recent results which are the most representative and significant for the development of the area. The papers for the volumes are drawn mainly from the annual International Conferences on Applications and Theory of Petri Nets. Selected papers from the latest conference are independently refereed, and revised and extended as necessary. Some further papers submitted directly to the editor are included. Advances in Petri Nets 1990 covers the Tenth International Conference on Applications and Theory of Petri Nets held in Bonn, Germany, in June 1989. Additional highlights of this volume include a tutorial on refinements of Petri nets by W. Brauer, R. Gold, and W. Vogler, and a tutorial on analysis and synthesis of free choice systems by J. Esparza and M. Silva, both prepared in the framework of the ESPRIT Basic Research Actions Project DEMON.

Physics students who want to become familiar with advanced computational strategies in classical and quantum dynamics will find here a detailed treatment many worked examples. This new edition has been revised and enlarged with chapters on the action principle in classical electrodynamics, on the functional derivative approach, and on computing traces.

Annotation The Symposium on Theoretical Aspects of Computer Science is organized jointly by the Special Interest Group for Applied Mathematics of AFCET (Association FranAaise de CybernA(c)tique Economique et Technique) and the Special Interest Group for Theoretical Computer Sciences of GI (Gesellschaft fA1/4r Informatik). It is held alternately in France and in Germany. This volume contains two invited papers, on combinatorial methods in computer science, and on the complexity of local optimization, and 24 contributions on theoretical aspects of computer science. Some software systems are presented showing the possibilities of applying theoretical research to the realization of software tools.

The proper treatment and choice of the basic data structures is an important and complex part in the process of program construction. Algebraic methods provide techniques for data abstraction and the structured specification, validation and analysis of data structures. This volume originates from a workshop organized within ESPRIT Project 432 METEOR, An Integrated Formal Approach to Industrial Software Development, held in Mierlo, The Netherlands, September 1989. The volume includes five invited contributions based on workshop talks given by A. Finkelstein, P. Klint, C.A. Middelburg, E.-R. Olderog, and H.A. Partsch. Ten further papers by members of the METEOR team are based on talks given at the workshop. The workshop was a successor to an earlier one held in Passau, Germany, June 1987, the proceedings of which were published as Lecture Notes in Computer Science, Vol. 394.