On the specification of operations on the rational behaviour of systems

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.

💡 Research Summary

The paper investigates structural operational semantics (SOS) from the abstract perspective of distributive laws of syntax over behaviour. In the categorical setting, a system type is modeled by an endofunctor F on a suitable category, and its behaviours are captured by the final F‑coalgebra νF, which contains the behaviours of all (possibly infinite) systems of that type. While many SOS formats guarantee that algebraic operations are well‑defined on νF, practitioners are often interested only in the behaviours of finite systems. The sub‑coalgebra consisting of behaviours that can be generated by a finite F‑coalgebra is called the rational fixpoint ρF; it is the carrier of all “finite” or “regular” behaviours (e.g., regular languages, finite-state processes, finite weighted transition systems).

The authors introduce a new specification format, called Rational SOS, that restricts the usual SOS rule schema so that every rule’s premises and conclusions involve only elements of the rational fixpoint. Concretely, a Rational SOS rule has the same three parts as a standard rule (a syntactic operator, a set of transition premises, and a conclusion), but each transition premise must be labelled by a finite set of actions and must refer to states that are themselves elements of ρF. Moreover, the conclusion must produce a state that is guaranteed to lie in ρF. This syntactic restriction is enforced by a side‑condition that can be checked locally on the rule.

The main technical result is a closure theorem: any algebraic operation defined by a set of Rational SOS rules yields a well‑defined operation on ρF, i.e., the rational fixpoint is closed under that operation. The proof proceeds by first recalling that ρF is a sub‑coalgebra of νF and that the inclusion ι : ρF → νF is a coalgebra homomorphism. The distributive law associated with the SOS format lifts to a natural transformation λ : Σ ∘ F ⇒ F ∘ Σ, where Σ is the syntax functor. By restricting λ to ρF (using the side‑conditions of Rational SOS) one obtains a distributive law λρ : Σ ∘ ρF ⇒ ρF ∘ Σ that respects the sub‑coalgebra structure. The authors then show, via an induction on the depth of derivations, that the interpretation of any closed term built with the specified operators yields a state in ρF. Hence the operation is closed on rational behaviours.

To demonstrate the practical relevance of the format, three families of examples are worked out in detail:

1. Regular languages – The syntax Σ includes union, concatenation and Kleene star. The rational fixpoint of the powerset functor P(Σ × –) is precisely the set of regular languages. The Rational SOS rules for the three operators are shown to satisfy the side‑conditions, and the closure theorem guarantees that the class of regular languages is closed under these operations, reproducing the classic closure properties of regular languages in a coalgebraic setting.

2. Regular processes – Here the functor models labelled transition systems with termination. The rational fixpoint corresponds to finite-state processes (e.g., CCS or CSP processes without recursion). The authors give SOS rules for parallel composition, choice, and hiding, all respecting the rational restriction. The resulting theorem confirms that the set of finite processes is closed under these operators, providing a uniform proof of known results in process algebra.

3. Finite weighted transition systems – The functor is a weighted version of the powerset functor, mapping a set X to the set of finitely supported functions X → W for a weight semiring W. The rational fixpoint consists of systems with finitely many states and finitely supported weight functions. Rational SOS rules for weighted sum and scalar multiplication are presented, and the closure theorem shows that finite weighted systems are closed under these algebraic constructions.

The related‑work discussion positions the contribution with respect to earlier SOS formats (e.g., GSOS, bialgebraic SOS) that target the final coalgebra, and to recent studies on rational fixpoints that mostly treat them as a semantic domain without providing a dedicated specification format. By integrating the rational restriction directly into the rule syntax, the paper bridges this gap and offers a systematic method for designing operations that are guaranteed to stay within the finite realm.

In conclusion, the paper provides a categorical foundation for specifying algebraic operations on finite behaviours, a rational SOS format that ensures closure of the rational fixpoint, and concrete applications that validate the approach. Future work suggested includes extending the format to richer functors (probabilistic, timed, hybrid), developing tool support for automatically checking the rational side‑conditions, and applying the theory to the design of domain‑specific languages where finiteness is a crucial property.