Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Abstract and concrete categories
Abstract and concrete categories
Journal of the ACM (JACM)
Communication and concurrency
Ntyft/ntyxt rules reduce to ntree rules
Information and Computation
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Handbook of Process Algebra
Compositional SOS and beyond: a coalgebraic view of open systems
Theoretical Computer Science
Bialgebraic Modelling of Timed Processes
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A First Order Coalgebraic Model of pi-Calculus Early Observational Equivalence
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Category Theory and Computer Science
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Abstract Syntax and Variable Binding
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Semantics of Name and Value Passing
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
A spatial logic for concurrency (part I)
Information and Computation - TACS 2001
Precongruence formats for decorated trace semantics
ACM Transactions on Computational Logic (TOCL)
Category theory for operational semantics
Theoretical Computer Science - Selected papers of CMCS'03
ACM SIGACT News
Distributive laws for the coinductive solution of recursive equations
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Coalgebraic semantics for timed processes
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Coalgebraic Modal Logic Beyond Sets
Electronic Notes in Theoretical Computer Science (ENTCS)
Bialgebraic Methods in Structural Operational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Bialgebraic Operational Semantics and Modal Logic
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Modularity of Behaviours for Mathematical Operational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
A Noninterleaving Model of Concurrency Based on Transition Systems with Spatial Structure
Electronic Notes in Theoretical Computer Science (ENTCS)
Presenting functors by operations and equations
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Expressivity of coalgebraic modal logic: the limits and beyond
FOSSACS'05 Proceedings of the 8th international 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
Testing semantics: connecting processes and process logics
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Structural operational semantics for weighted transition systems
Semantics and algebraic specification
Structural Operational Semantics and Modal Logic, Revisited
Electronic Notes in Theoretical Computer Science (ENTCS)
Generic forward and backward simulations II: probabilistic simulation
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Traces for coalgebraic components
Mathematical Structures in Computer Science
Pointwise extensions of gsos-defined operations
Mathematical Structures in Computer Science
The microcosm principle and compositionality of GSOS-based component calculi
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Towards Effects in Mathematical Operational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
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
| Hi-index | 0.00 |
Bialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal reasoning about well-behaved structural operational semantics (SOS). An extension of algebraic and coalgebraic methods, it abstracts from concrete notions of syntax and system behaviour, thus treating various kinds of operational descriptions in a uniform fashion. In this paper, bialgebraic semantics is combined with a coalgebraic approach to modal logic in a novel, general approach to proving the compositionality of process equivalences for languages defined by structural operational semantics. To prove compositionality, one provides a notion of behaviour for logical formulas, and defines an SOS-like specification of modal operators which reflects the original SOS specification of the language. This approach can be used to define SOS congruence formats as well as to prove compositionality for specific languages and equivalences.