Transition System Specifications in Stalk Formal with Bisimulation as a Congruence

A many-sorted variant, called stalk format, of the single sorted tyft-format for transition system specifications, introduced by Groote and Vaandrager, is proposed. The stalk format is shown to be a convenient formalism to express continuation-style transition systems for which the existing formats seem less adequate. Extending a similar result for the single sorted case, it holds that for an appropriate generalization of strong bisimilarity for the present many-sorted setting, bisimulation with respect to a transition system specification in stalk format, is a congruence. The present format is compared with several existing ones in the literature, viz. De Simone-, GSOS- and pure tyft-format.

[1]  Robin Milner,et al.  Operational and Algebraic Semantics of Concurrent Processes , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[2]  Erik P. de Vink,et al.  Comparative Semantics for PROLOG with Cut , 1990, Sci. Comput. Program..

[3]  Robert de Simone,et al.  Higher-Level Synchronising Devices in Meije-SCCS , 1985, Theor. Comput. Sci..

[4]  Jos C. M. Baeten,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates , 1993, CONCUR.

[5]  Kim G. Larsen,et al.  Bisimulation through probabilistic testing (preliminary report) , 1989, POPL '89.

[6]  Wan Fokkink.  The Tyft/Tyxt Format Reduces to Tree Rules , 1994, TACS.

[7]  Chris Verhoef,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates and Negative Premises , 1994, Nord. J. Comput..

[8]  Rob J. van Glabbeek,et al.  Bounded Nondeterminism and the Approximation Induction Principle in Process Algebra , 1987, STACS.

[9]  Pierre America,et al.  Designing Equivalent Semantic Models for Process Creation , 1988, Theor. Comput. Sci..

[10]  Jan Friso Groote,et al.  Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..

[11]  Erik P. de Vink,et al.  Bisimulation Semantics for Concurrency with Atomicity and Action Refinement , 1994, Fundam. Informaticae.

[12]  Jan Friso Groote.  Transition System Specifications with Negative Premises (Extended Abstract) , 1990, CONCUR.

[13]  A. Ens,et al.  Asynchronous Rendez-vous in Distributed Logic Programming , 1993 .

[14]  Joost N. Kok,et al.  Uniform Abstraction, Atomicity and Contractions in the Comparative Semantics of Concurrent Prolog , 1988, FGCS.

[15]  Erik P. de Vink,et al.  Asynchronous Rendez-vous in Distributed Logic Programming , 1992, REX Workshop.

[16]  Jan J. M. M. Rutten.  Processes as Terms: Non-Well-Founded Models for Bisimulation , 1992, Math. Struct. Comput. Sci..

[17]  Erik P. de Vink,et al.  Continuation Semantics for PROLOG with Cut , 1989, TAPSOFT, Vol.1.

[18]  J. W. de Bakker,et al.  Comparative Semantics for Flow of Control in Logic Programming without Logic , 1991, Inf. Comput..

[19]  G. Boudol,et al.  Notes on Algebraic Calculi of Processes , 1989, Logics and Models of Concurrent Systems.

[20]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

[21]  Jan J. M. M. Rutten.  Deriving Denotational Models for Bisimulation from Structured Operational Semantics , 1990, Programming Concepts and Methods.

[22]  J. Goguen,et al.  Order-Sorted Equational Computation , 1989 .

[23]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[24]  Albert R. Meyer,et al.  Bisimulation can't be traced , 1988, POPL '88.

[25]  Jan Friso Groote,et al.  The Meaning of Negative Premises in Transition System Specifications , 1991, ICALP.

[26]  Philippe Darondeau,et al.  Trace Nets , 1992, REX Workshop.

[27]  BolRoland,et al.  The meaning of negative premises in transition system specifications , 1996 .

[28]  J. J. M. M. Rutten.  Semantic Correctness for a Parallel Object-Oriented Language , 1990, SIAM J. Comput..

[29]  Wolfgang Wechler,et al.  Universal Algebra for Computer Scientists , 1992, EATCS Monographs on Theoretical Computer Science.

[30]  Jan A. Bergstra,et al.  Readies and Failures in the Algebra of Communicating Processes , 1988, SIAM J. Comput..

[31]  Erik P. de Vink,et al.  CCS for OO and LP , 1991, TAPSOFT, Vol.2.

[32]  P.H.M. America,et al.  A parallel object-oriented language: design and semantic foundations , 1989 .