Search

• < Previous
• 1
• Next >

Symbolic and Asynchronous Semantics via Normalized Coalgebras

The operational semantics of interactive systems is usually described by labeled transition systems. Abstract semantics (that is defined in terms of bisimilarity) is characterized by the final morphism in some category of coalgebras. Since the behaviour of interactive systems is for many reasons&nbsp;[&hellip;]