Communicating sequential processes
Communicating sequential processes
Initial computability, algebraic specifications, and partial algebras
Initial computability, algebraic specifications, and partial algebras
Category theory for computing science
Category theory for computing science
An algebraic approach to deduction in equational partial horn theories
Journal of Information Processing and Cybernetics
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
CSP, partial automata, and coalgebras
Theoretical Computer Science
Fundamentals of Algebraic Specification I
Fundamentals of Algebraic Specification I
Automata and coinduction (an exercise in coalgebra)
Automata and coinduction (an exercise in coalgebra)
Categories for Software Engineering
Categories for Software Engineering
Cofree coalgebras for signature morphisms
Formal Methods in Software and Systems Modeling
| Hi-index | 0.00 |
We present a model theoretic analysis of synchronization of deterministic CSP processes. We show that there is co-amalgamation within the indexed coalgebraic reconstruction of CSP developed in [14]. Synchronization, however, can not be characterized in terms of co-amalgamation. We show that synchronization can be described, nevertheless, as a pullback construction within the corresponding fibred algebraic setting. Analyzing and generalizing the transition between the indexed and the fibred setting we show that for a wide range of signature embeddings ϕ : Σ1 → Σ2 the Σ1-algebras, traditionally considered as parameter algebras, can be considered also as signatures, instead.