Breaking Symmetries

@article{Peters2010BreakingS,
  title={Breaking Symmetries},
  author={Kirstin Peters and Uwe Nestmann},
  journal={ArXiv},
  year={2010},
  volume={abs/1007.4172}
}
  • Kirstin Peters, Uwe Nestmann
  • Published 2010
  • Computer Science
  • ArXiv
  • A well-known result by Palamidessi tells us that πmix (the π-calculus with mixed choice) is more expressive thanπsep(its subset with only separate choice). The proof of this res ult argues with their different expressive power concerning leader election in s ymmetric networks. Later on, Gorla offered an arguably simpler proof that, instead of leader elec tion in symmetric networks, employed the reducibility of “incestual” processes (mixed choices that include both enabled senders and receivers… CONTINUE READING

    Figures and Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-6 OF 6 REFERENCES

    Expressiveness of Process Algebras

    On the Existence of Symmetric Algorithms to Find Leaders in Networks of Communicating Sequential Processes

    • Daniele Gorla
    • Acta Informatica
    • 1988