Journal of the ACM (JACM)
Model checking
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
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
Modeling component connectors in Reo by constraint automata
Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
A basic algebra of stateless connectors
Theoretical Computer Science - Algebra and coalgebra in computer science
Bialgebraic methods and modal logic in structural operational semantics
Information and Computation
Modelling of Complex Systems: Systems as Dataflow Machines
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Automata for Context-Dependent Connectors
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
A Uniform Framework for Modeling and Verifying Components and Connectors
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
The microcosm principle and concurrency in coalgebra
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Structural operational semantics for weighted transition systems
Semantics and algebraic specification
Quantitative Kleene coalgebras
Information and Computation
| Hi-index | 0.00 |
In the previous work by Jacobs, Sokolova and the author, synchronous parallel composition of coalgebras--yielding a coalgebra--and parallel composition of behaviors--yielding a behavior, where behaviors are identified with states of the final coalgebra--were observed to form an instance of the microcosm principle. The microcosm principle, a term by Baez and Dolan, refers to the general phenomenon of nested algebraic structures such as a monoid in a monoidal category. Suitable organization of these two levels of parallel composition led to a general compositionality theorem: the behavior of the composed system relies only on the behaviors of its constituent parts. In the current paper this framework is extended so that it accommodates any process operator--not restricted to parallel composition--whose meaning is specified by means of GSOS rules. This generalizes Turi and Plotkin's bialgebraic modeling of GSOS, by allowing a process operator to act as a connector between components as coalgebras.