Nonsequential Automata Semantics for a Concurrent, Object-Based Language

Abstract Nonsequential automata constitute a categorial semantic domain based on labeled transition system with full concurrency, where restriction and relabeling are functorial and a class of morphisms stands for reification. It is a model for concurrency which satisfies the diagonal compositionality requirement, i.e., reifications compose (vertically) and distribute over combinators (horizontally). To experiment with the proposed semantic domain, a semantics for a concurrent, object-based language is given. It is a simplified and revised version of the object-oriented specification language GNOME, introducing some special features inspired by the semantic domain such as reification and aggregation. The diagonal compositionality is an essential property to give semantics in this context.

[1]  M. E. Szabo.  Algebra of proofs , 1978 .

[2]  José Meseguer,et al.  Petri Nets Are Monoids , 1990, Inf. Comput..

[3]  Colette Rolland,et al.  Object Oriented Approach in Information Systems , 1991 .

[4]  Amílcar Sernadas,et al.  What is an Object, After All? , 1990, DS-4.

[5]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[6]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[7]  Glynn Winskel,et al.  Petri Nets, Algebras, Morphisms, and Compositionality , 1987, Inf. Comput..

[8]  S. Lane.  Categories for the Working Mathematician , 1971 .

[9]  Glynn Winskel,et al.  A Classification of Models for Concurrency , 1993, CONCUR.

[10]  Paulo Blauth Menezes,et al.  Synchronization in Petri Nets , 1996, Fundam. Informaticae.

[11]  Giuseppe Longo,et al.  Categories, types and structures - an introduction to category theory for the working computer scientist , 1991, Foundations of computing.

[12]  Grzegorz Rozenberg,et al.  Stepwise Refinement of Distributed Systems Models, Formalisms, Correctness , 1989, Lecture Notes in Computer Science.

[13]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[14]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[15]  Antoni W. Mazurkiewicz,et al.  Basic notions of trace theory , 1988, REX Workshop.

[16]  Amílcar Sernadas,et al.  Algebraic Implementation of Objects over Objects , 1989, REX Workshop.

[17]  Amílcar Sernadas,et al.  Refinement in a concurrent, object-based language , 1996 .

[18]  William Kent,et al.  Object-Oriented Databases: Analysis, Design and Construction , 1991 .

[19]  José Luiz Fiadeiro,et al.  Mirror, Mirror in my Hand: A Duality between Specifications and Models of Process Behaviour , 1996, Math. Struct. Comput. Sci..

[20]  Marek Antoni Bednarczyk,et al.  Categories of asynchronous systems , 1987 .

[21]  Paulo Blauth Menezes,et al.  Systems for system implementation , 1996 .

[22]  Peter Wegner,et al.  Concepts and paradigms of object-oriented programming , 1990, OOPS.

[23]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.