Semantics of reactive systems : comparison and full abstraction

We present a fully abstract semantica for reai-time distributed computing of the Ada and OCCAM kind in a denotational style. This semantica turns termination, communication along channels, and the time communication takes place, into observables. Yet it is the coarsest semantica to do so which is syntax-directed (this is known as full abstraction). It ·extends the linear history semantica for CSP of Francez, Lehman and Pnueli. Our execution model is based on maximizing concurrent activity as opposed to interleaving (in which only one action occurs at the time and arbitrary delays are incurred between actions). It is a variant of the maximal parallelism model of Salwicki and Müldner.

[1]  Matthew Hennessy,et al.  Full Abstraction for a Simple Parallel Programming Language , 1979, MFCS.

[2]  Tomasz Müldner,et al.  On the Algorithmic Properties of Concurrent Programs , 1979, Logic of Programs.

[3]  Arthur J. Bernstein,et al.  Proving real-time properties of programs with temporal logic , 1981, SOSP.

[4]  Willem P. de Roever,et al.  Examples of a Real-Time Temporal Logic Specification , 1983, The Analysis of Concurrent Systems.

[5]  Zohar Manna,et al.  How to cook a temporal proof system for your pet language , 1983, POPL '83.

[6]  Willem P. de Roever,et al.  Real-time programming and asynchronous message passing , 1983, PODC '83.

[7]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

[8]  Manfred Broy,et al.  Applicative Real-Time Programming , 1983, IFIP Congress.

[9]  Leslie Lamport,et al.  Specifying Concurrent Program Modules , 1983, TOPL.

[10]  Zohar Manna,et al.  Reasoning in Interval Temporal Logic , 1983, Logic of Programs.

[11]  Gérard Berry,et al.  The ESTEREL Synchronous Programming Language and its Mathematical Semantics , 1984, Seminar on Concurrency.

[12]  Amir Pnueli,et al.  On the Development of Reactive Systems , 1989, Logics and Models of Concurrent Systems.

[13]  Nicolas Halbwachs,et al.  Outline of a Real Time Data Flow Language , 1985, RTSS.

[14]  Amir Pnueli,et al.  A really abstract concurrent model and its temporal logic , 1986, POPL '86.

[15]  Amir Pnueli,et al.  Applications of Temporal Logic to the Specification and Verification of Reactive Systems: A Survey of Current Trends , 1986, Current Trends in Concurrency.

[16]  Albert Benveniste,et al.  Signal-A data flow-oriented language for signal processing , 1986, IEEE Trans. Acoust. Speech Signal Process..

[17]  David Harel,et al.  Statecharts: A Visual Formalism for Complex Systems , 1987, Sci. Comput. Program..

[18]  Andy Boucher,et al.  A Timed Failures Model for Extended Communicating Processes , 1987, ICALP.

[19]  Jozef Hooman,et al.  A Compositional Proof Theory for Real-Time Distributed Message Passing , 1987, PARLE.

[20]  Werner Damm,et al.  An Axiomatic Approach to the Specification of Distributed Computer Architectures , 1987, PARLE.

[21]  Willem P. de Roever,et al.  Full abstraction of a real-time denotational semantics for an OCCAM-like language , 1987, POPL '87.

[22]  Amir Pnueli,et al.  On the Formal Semantics of Statecharts (Extended Abstract) , 1987, LICS.

[23]  Doron Drusinsky,et al.  On the Power of Cooperative Concurrency , 1988, Concurrency.

[24]  Sharon L. Smith,et al.  STATEMATE and cruise control: a case study , 1988, Proceedings COMPSAC 88: The Twelfth Annual International Computer Software & Applications Conference.

[25]  Amnon Naamad,et al.  Statemate: a working environment for the development of complex reactive systems , 1988, ICSE '88.

[26]  Georges Gonthier.  Sémantiques et modèles d'exécution des langages réactifs synchrones : application à Esterel , 1988 .

[27]  Willem P. de Roever,et al.  Compositional Semantics for Real-Time Distributed Computing , 1985, Inf. Comput..

[28]  R. Gerth,et al.  Modeling Statecharts Behaviour in a Fully Abstract Way , 1988, CAAP.

[29]  David Harel,et al.  On visual formalisms , 1988, CACM.

[30]  Jennifer Widom,et al.  A Temporal-Logic Based Compositional Proof System for Real-Time Message Passing , 1989, PARLE.

[31]  Doron Drusinsky,et al.  Using statecharts for hardware description and synthesis , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[32]  David Harel,et al.  A Thesis for Bounded Concurrency , 1989, MFCS.

[33]  Amir Pnueli,et al.  What is in a step , 1989 .

[34]  Florence Maraninchi,et al.  Argonaute: Graphical Description, Semantics and Verification of Reactive Systems by Using a Process Algebra , 1989, Automatic Verification Methods for Finite State Systems.

[35]  Roni Rosner,et al.  On the power of bounded concurrency. III. Reasoning about programs , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[36]  David Harel,et al.  On the Power of Bounded Concurrency II: The Pushdown Automata Level , 1990, CAAP.

[37]  Joseph Sifakis,et al.  ATP: an Algebra for Timed Processes , 1990, Programming Concepts and Methods.

[38]  Yoav Shoham,et al.  A propositional modal logic of time intervals , 1991, JACM.

[39]  Gérard Berry,et al.  The Esterel Synchronous Programming Language: Design, Semantics, Implementation , 1992, Sci. Comput. Program..

[40]  Pierre Falzon,et al.  Institut national de recherche en informatique et en automatique , 1992 .

[41]  David Harel,et al.  On statecharts with overlapping , 1992, TSEM.