Corpus ID: 38189382

Binary Multirelations

  title={Binary Multirelations},
  author={H. Furusawa and G. Struth},
  journal={Arch. Formal Proofs},
Binary multirelations associate elements of a set with its subsets; hence they are binary relations of type A × 2. Applications include alternating automata, models and logics for games, program semantics with dual demonic and angelic nondeterministic choices and concurrent dynamic logics. This proof document supports an arXiv article that formalises the basic algebra of multirelations and proposes axiom systems for them, ranging from weak bi-monoids to weak bi-quantales. 
Stone Algebras
A range of algebras between lattices and Boolean algebraes generalise the notion of a complement and a hierarchy of these pseudo-complemented alge Branches is developed that includes Stone algeBRas. Expand
Kleene Algebras with Domain
This work formalises a modular hierarchy of algebras with domain and antidomain (domain complement) operations in Isabelle/HOL that ranges from domain and antidote semigroups to modal Kleene alge bras and divergence Kleenes. Expand


Taming Multirelations
This work proposes axiom systems for multirelations in contexts ranging from bi-monoids to bi-quantales and under the operations of union, intersection, sequential, and parallel composition, as well as finite and infinite iteration. Expand
Concurrent Dynamic Algebra
Algebraic variants of Peleg’s axioms are shown to be derivable in these algebras, and their soundness is proved relative to the multirelational model. Expand
Concurrent dynamic logic
This paper investigates extensions of dynamic logic tailored towards handling concurrent programs, with or without communication, and finds that both respects are dominated by the extent to which the capabilities of synchronization and (unbounded) counting are enabled in the system. Expand
Taming multirelations. CoRR, abs/1501
  • Taming multirelations. CoRR, abs/1501
  • 2015
lemma c6 : R · 1 π ⊆ 1 π by (clarsimp simp: mr-simp) Next we verify Lemma 3
  • lemma c6 : R · 1 π ⊆ 1 π by (clarsimp simp: mr-simp) Next we verify Lemma 3