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}
}
  • H. Furusawa, G. Struth
  • Published 2016
  • Computer Science, Mathematics
  • ACM Transactions on Computational Logic (TOCL)
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. 
Binary Multirelations
Kleisli, Parikh and Peleg compositions and liftings for multirelations
An algebraic approach to multirelations and their properties
On the construction of multi-valued concurrent dynamic logic

References

SHOWING 1-9 OF 9 REFERENCES
Concurrent dynamic logic
Propositional game logic
  • R. Parikh
  • Computer Science
  • 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
  • 1983
Communication in Concurrent Dynamic Logic
  • D. Peleg
  • Computer Science
  • J. Comput. Syst. Sci.
  • 1987
The logic of games and its applications
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