On the structure of categories of coalgebras
Theoretical Computer Science
Combining a monad and a comonad
Theoretical Computer Science
Mongruences and Cofree Coalgebras
AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
Bialgebraic Modelling of Timed Processes
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Real-Time Behaviour of Asynchronous Agents
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
An Overview and Synthesis on Timed Process Algebras
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A Comparison of Additivity Axioms in Timed Transition Systems.
A Comparison of Additivity Axioms in Timed Transition Systems.
Combining effects: sum and tensor
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Category theory for operational semantics
Theoretical Computer Science - Selected papers of CMCS'03
Bialgebraic Methods in Structural Operational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Bialgebraic methods and modal logic in structural operational semantics
Information and Computation
Coalgebraic semantics for timed processes
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Modularity and Implementation of Mathematical Operational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
Some years ago, Turi and Plotkin gave a precise mathematical formulation of a notion of structural operational semantics: their formulation is equivalent to a distributive law of the free monad on a signature over the cofree copointed endofunctor on a behaviour endofunctor. From such a distributive law, one can readily induce a distributive law of the monad over the cofree comonad on the behaviour endofunctor, and much of their analysis can be carried out in the latter terms, adding a little more generality that proves to be vital here. Here, largely at the latter level of generality, we investigate the situation in which one has two sorts of behaviours, with operational semantics possibly interacting with each other. Our leading examples are given by combining action and timing, with a modular account of the operational semantics for the combination induced by that of each of the two components. Our study necessitates investigation and new results about products of comonads and liftings of monads to categories of coalgebras for the product of comonads, providing constructions with which one can readily calculate.