# Taming Multirelations

@article{Furusawa2016TamingM, title={Taming Multirelations}, author={H. Furusawa and G. Struth}, journal={ACM Transactions on Computational Logic (TOCL)}, year={2016}, volume={17}, pages={1 - 34} }

Binary multirelations generalise binary relations by associating elements of a set to its subsets. We study the structure and algebra of multirelations under the operations of union, intersection, sequential, and parallel composition, as well as finite and infinite iteration. Starting from a set-theoretic investigation, we propose axiom systems for multirelations in contexts ranging from bi-monoids to bi-quantales.

#### 7 Citations

Relational Formalisations of Compositions and Liftings of Multirelations

- Mathematics, Computer Science
- RAMICS
- 2015

Kleisli, Parikh and Peleg compositions and liftings for multirelations

- Mathematics, Computer Science
- J. Log. Algebraic Methods Program.
- 2017

An algebraic approach to multirelations and their properties

- Mathematics, Computer Science
- J. Log. Algebraic Methods Program.
- 2017

On the construction of multi-valued concurrent dynamic logic

- Computer Science, Mathematics
- DaLí
- 2019

Differential Hoare Logics and Refinement Calculi for Hybrid Systems with Isabelle/HOL

- Computer Science
- RAMiCS
- 2020

#### References

SHOWING 1-9 OF 9 REFERENCES

Propositional game logic

- Computer Science
- 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
- 1983

Communication in Concurrent Dynamic Logic

- Computer Science
- J. Comput. Syst. Sci.
- 1987

Concurrent dynamic algebra. CoRR, abs/1407

- Concurrent dynamic algebra. CoRR, abs/1407
- 2014

Alternation

- J. ACM, 28(1):114–133
- 1981

Alternation. J. ACM

- Alternation. J. ACM
- 1981

Alternation. Journal of the ACM

- Alternation. Journal of the ACM
- 1981

Binary multirelations. Archive of Formal Proofs

- Binary multirelations. Archive of Formal Proofs
- 2015