AbstractMany process algebras are defined by structural operational semantics (SOS). Indeed, most such definitions are nicely structured and fit the GSOS format of Bloom et al. (J. Assoc. Comput. Mach., to appear). We give a procedure for converting any GSOS language definition to a finite complete equational axiom system (possibly with one infinitary induction principle) which precisely characterizes strong bisimulation of processes
Structural Operational Semantics (SOS) is one of the most natural ways for providing programming lan...
For structural operational semantics (SOS) of process algebras, various notions of bisimulation have...
We investigate the relationship between operational semantics, equational semantics, and ready equi...
AbstractMany process algebras are defined by structural operational semantics (SOS). Indeed, most su...
An existing axiomatization strategy for process algebras modulo bisimulation semantics can be extend...
In the field of structural operational semantics (SOS), there have been several proposals both for s...
An existing axiomatization strategy for process algebras modulo bisimulation semantics can be extend...
In this paper, we introduce an extension of the GSOS rule format with predicates such as termination...
In this paper, we introduce an extension of the GSOS rule format with predicates such as termination...
We discuss a combination of GSOS-type structural operational semantics with explicit termination, th...
In the field of structural operational semantics (SOS), there have been several proposals both for s...
Final coalgebras capture system behaviours such as streams, infinite trees and processes. Algebraic ...
Final coalgebras capture system behaviours such as streams, infinite trees and processes. Algebraic ...
AbstractWe present a general and uniform method for defining structural operational semantics (SOS) ...
Final coalgebras capture system behaviours such as streams, infinite trees and processes. Algebraic ...
Structural Operational Semantics (SOS) is one of the most natural ways for providing programming lan...
For structural operational semantics (SOS) of process algebras, various notions of bisimulation have...
We investigate the relationship between operational semantics, equational semantics, and ready equi...
AbstractMany process algebras are defined by structural operational semantics (SOS). Indeed, most su...
An existing axiomatization strategy for process algebras modulo bisimulation semantics can be extend...
In the field of structural operational semantics (SOS), there have been several proposals both for s...
An existing axiomatization strategy for process algebras modulo bisimulation semantics can be extend...
In this paper, we introduce an extension of the GSOS rule format with predicates such as termination...
In this paper, we introduce an extension of the GSOS rule format with predicates such as termination...
We discuss a combination of GSOS-type structural operational semantics with explicit termination, th...
In the field of structural operational semantics (SOS), there have been several proposals both for s...
Final coalgebras capture system behaviours such as streams, infinite trees and processes. Algebraic ...
Final coalgebras capture system behaviours such as streams, infinite trees and processes. Algebraic ...
AbstractWe present a general and uniform method for defining structural operational semantics (SOS) ...
Final coalgebras capture system behaviours such as streams, infinite trees and processes. Algebraic ...
Structural Operational Semantics (SOS) is one of the most natural ways for providing programming lan...
For structural operational semantics (SOS) of process algebras, various notions of bisimulation have...
We investigate the relationship between operational semantics, equational semantics, and ready equi...
DOI
Add to ORKG