AbstractRecently there has been considerable interest in studying formats of Plotkin style inference rules which ensure that the induced labelled transition system semantics have certain properties. In this note, I shall give a contribution to this line of research by giving a restricted version of Bloom, Istrail and Meyer's GSOS format Bloom et al. (1988), Bloom (1989) which induces finite labelled transition systems
AbstractWe discuss a combination of GSOS-type structural operational semantics with explicit termina...
Some formats of well-behaved operational specifications, correspond to natural transformations of ce...
In this paper the question is considered in which cases a transition system specification in Plotkin...
AbstractRecently there has been considerable interest in studying formats of Plotkin style inference...
AbstractWe introduce probabilistic GSOS, an operator specification format for (reactive) probabilist...
AbstractGSOS is a specification format for well-behaved operations on transition systems. Aceto intr...
We introduce PGSOS, an operator specification format for (reactive) probabilistic transition systems...
AbstractIn this paper, we present a general way of giving denotational semantics to a class of langu...
AbstractIn this article the general approach to Plotkin-style operational semantics of Groote and Va...
AbstractIn this paper we are interested in general properties of classes of transition system specif...
We discuss a combination of GSOS-type structural operational semantics with explicit termination, th...
We discuss acom bination of GSOS-type structural operationalsema tics with explicittermit.(kwfi tha...
Final coalgebras capture system behaviours such as streams, infinite trees and processes. Algebraic ...
Recently, unifying theories for processes combining non-determinism with quantitative aspects (such ...
In this paper, we introduce an extension of the GSOS rule format with predicates such as termination...
AbstractWe discuss a combination of GSOS-type structural operational semantics with explicit termina...
Some formats of well-behaved operational specifications, correspond to natural transformations of ce...
In this paper the question is considered in which cases a transition system specification in Plotkin...
AbstractRecently there has been considerable interest in studying formats of Plotkin style inference...
AbstractWe introduce probabilistic GSOS, an operator specification format for (reactive) probabilist...
AbstractGSOS is a specification format for well-behaved operations on transition systems. Aceto intr...
We introduce PGSOS, an operator specification format for (reactive) probabilistic transition systems...
AbstractIn this paper, we present a general way of giving denotational semantics to a class of langu...
AbstractIn this article the general approach to Plotkin-style operational semantics of Groote and Va...
AbstractIn this paper we are interested in general properties of classes of transition system specif...
We discuss a combination of GSOS-type structural operational semantics with explicit termination, th...
We discuss acom bination of GSOS-type structural operationalsema tics with explicittermit.(kwfi tha...
Final coalgebras capture system behaviours such as streams, infinite trees and processes. Algebraic ...
Recently, unifying theories for processes combining non-determinism with quantitative aspects (such ...
In this paper, we introduce an extension of the GSOS rule format with predicates such as termination...
AbstractWe discuss a combination of GSOS-type structural operational semantics with explicit termina...
Some formats of well-behaved operational specifications, correspond to natural transformations of ce...
In this paper the question is considered in which cases a transition system specification in Plotkin...
DOI
Add to ORKG