Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Combining a monad and a comonad
Theoretical Computer Science
Semantical Principles in the Modal Logic of Coalgebras
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Category theory for operational semantics
Theoretical Computer Science - Selected papers of CMCS'03
ACM SIGACT News
Coalgebraic Modal Logic Beyond Sets
Electronic Notes in Theoretical Computer Science (ENTCS)
Bialgebraic methods and modal logic in structural operational semantics
Information and Computation
Trace Semantics for Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
A Hierarchy of SOS Rule Formats
Electronic Notes in Theoretical Computer Science (ENTCS)
The goldblatt-thomason theorem for coalgebras
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Exemplaric Expressivity of Modal Logics
Journal of Logic and Computation
Presenting functors by operations and equations
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Duality for logics of transition systems
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Distributive-law semantics for cellular automata and agent-based models
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Towards bialgebraic semantics for the linear time --- branching time spectrum
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
Compositionality of probabilistic Hennessy-Milner logic through structural operational semantics
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Hi-index | 0.00 |
A previously introduced combination of the bialgebraic approach to structural operational semantics with coalgebraic modal logic is re-examined and improved in some aspects. Firstly, a more abstract, conceptual proof of the main compositionality theorem is given, based on an understanding of modal logic as a study of coalgebras in slice categories of adjunctions. Secondly, a more concrete understanding of the assumptions of the theorem is provided, where proving compositionality amounts to finding a syntactic distributive law between two collections of predicate liftings.