Structural operational semantics and bounded nondeterminism

Abstract. We present a rule format for structural operational semantics to guarantee that the associated labelled transition system is bounded nondeterministic.

[1]  Wan Fokkink,et al.  Language preorder as a precongruence , 2000, Theor. Comput. Sci..

[2]  Frits W. Vaandrager,et al.  On the relationship between process algebra and input/output automata , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[3]  Bard Bloom.  CHOCOLATE: Calculi of Higher Order COmmunication and LAmbda TErms (preliminary report) , 1994, POPL '94.

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

[5]  Chris Verhoef,et al.  A General Conservative Extension Theorem in Process Algebra , 1994, PROCOMET.

[6]  Wan Fokkink,et al.  Precongruence formats for decorated trace preorders , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[7]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[8]  Teodor C. Przymusinski.  The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics , 1990, Fundam. Inform..

[9]  Bard Bloom,et al.  Structural Operational Semantics for Weak Bisimulations , 1995, Theor. Comput. Sci..

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

[11]  A. S. Klusener,et al.  Models and axioms for a fragment of real time process algebra , 1993 .

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

[13]  Rob J. van Glabbeek,et al.  The meaning of negative premises in transition system specifications II , 1996, J. Log. Algebraic Methods Program..

[14]  Jan Friso Groote,et al.  Transition System Specifications with Negative Premises , 1993, Theor. Comput. Sci..

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

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

[17]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[18]  Wan Fokkink,et al.  Rooted Branching Bisimulation as a Congruence , 2000, J. Comput. Syst. Sci..

[19]  S. P. Luttik.  Choice quantification in process algebra , 2002 .

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

[21]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[22]  Frits W. Vaandrager,et al.  Expressiveness results for process algebras , 1993 .

[23]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

[24]  Jan A. Bergstra,et al.  Process Algebra with Iteration and Nesting , 1994, Comput. J..

[25]  Jan A. Bergstra,et al.  Syntax and defining equations for an interrupt mechanism in process algebra , 1985 .

[26]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[27]  Irek Ulidowski,et al.  Equivalences on observable processes , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[28]  Frits W. Vaandrager,et al.  Expressive Results for Process Algebras , 1992, REX Workshop.

[29]  Bard Bloom,et al.  When is partial trace equivalence adequate? , 1994, Formal Aspects of Computing.

[30]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.