Structural operational semantics can be studied at the general level of distributive laws of syntax over behaviour. This yields specification formats for well-behaved algebraic operations on final coalgebras, which are a domain for the behaviour of all systems of a given type functor. We introduce a format for specification of algebraic operations that restrict to the rational fixpoint of a functor, which captures the behaviour of finite systems. In other words, we show that rational behaviour is closed under operations specified in our format. As applications we consider operations on regular languages, regular processes and finite weighted transition systems
AbstractIn this paper, we study extensions of mathematical operational semantics with algebraic effe...
A useful tool for modelling behaviour in theoretical computer science is the concept of coalgebras. ...
Labeled state-to-function transition systems, FuTS for short, are characterized by transitions which...
AbstractGSOS is a specification format for well-behaved operations on transition systems. Aceto intr...
Final coalgebras capture system behaviours such as streams, infinite trees and processes. Algebraic ...
We present a categorical theory of `well-behaved' operational semantics which aims at complemen...
Final coalgebras capture system behaviours such as streams, infinite trees and processes. Algebraic ...
AbstractSome years ago, Turi and Plotkin gave a precise mathematical formulation of a notion of stru...
Final coalgebras capture system behaviours such as streams, infinite trees and processes. Algebraic ...
The algebraic approach to modular specifications as developed by the first author during the last fi...
The rational fixed point of a set functor is well-known to capture thebehaviour of finite coalgebras...
We present a systematic way to generate (1) languages of (generalised) regular expressions, and (2) ...
We develop a taxonomy of different behavioral specification theories and expose their algebraic prop...
Given a category C with finite products and a strong monad T on C, we investigate axioms under which...
AbstractGiven a category C with finite products and a strong monad T on C, we investigate axioms und...
AbstractIn this paper, we study extensions of mathematical operational semantics with algebraic effe...
A useful tool for modelling behaviour in theoretical computer science is the concept of coalgebras. ...
Labeled state-to-function transition systems, FuTS for short, are characterized by transitions which...
AbstractGSOS is a specification format for well-behaved operations on transition systems. Aceto intr...
Final coalgebras capture system behaviours such as streams, infinite trees and processes. Algebraic ...
We present a categorical theory of `well-behaved' operational semantics which aims at complemen...
Final coalgebras capture system behaviours such as streams, infinite trees and processes. Algebraic ...
AbstractSome years ago, Turi and Plotkin gave a precise mathematical formulation of a notion of stru...
Final coalgebras capture system behaviours such as streams, infinite trees and processes. Algebraic ...
The algebraic approach to modular specifications as developed by the first author during the last fi...
The rational fixed point of a set functor is well-known to capture thebehaviour of finite coalgebras...
We present a systematic way to generate (1) languages of (generalised) regular expressions, and (2) ...
We develop a taxonomy of different behavioral specification theories and expose their algebraic prop...
Given a category C with finite products and a strong monad T on C, we investigate axioms under which...
AbstractGiven a category C with finite products and a strong monad T on C, we investigate axioms und...
AbstractIn this paper, we study extensions of mathematical operational semantics with algebraic effe...
A useful tool for modelling behaviour in theoretical computer science is the concept of coalgebras. ...
Labeled state-to-function transition systems, FuTS for short, are characterized by transitions which...