References

  1. Christian Badertscher, Peter Gaži, Aggelos Kiayias, Alexander Russell & Vassilis Zikas (2018): Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic Availability. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security. ACM, New York, pp. 913–930, doi:10.1145/3243734.3243848. Available at https://iohk.io/en/research/library/papers/ouroboros-genesiscomposable-proof-of-stake-blockchains-with-dynamic-availability/.
  2. Ra'Ed Bani-Abdelrahman (2018): Specification and Verification of Network Algorithms using Temporal Logic. Loughborough University, Loughborough, England, doi:10.26174/thesis.lboro.8138030.v1.
  3. Reuven Bar-Yehuda, Oded Goldreich & Alon Itai (1989): Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with No Collision Detection. In: Jean-Claude Bermond & Michel Raynal: Distributed Algorithms, Lecture Notes in Computer Science 392. Springer, Berlin/Heidelberg, Germany, pp. 24–32, doi:10.1007/3-540-51687-5_29.
  4. Twan Basten & Marc Voorhoeve (1995): An Algebraic Semantics for Hierarchical P/T Nets. In: Giorgio De Michelis & Michel Diaz: Application and Theory of Petri Nets 1995, Lecture Notes in Computer Science 935. Springer, Berlin/Heidelberg, Germany, pp. 45–65, doi:10.1007/3-540-60029-9_33.
  5. Eike Best, Raymond Devillers & Maciej Koutny (2001): A Unified Model for Nets and Process Algebras. In: J. A. Bergstra, A. Ponse & S. A. Smolka: Handbook of Process Algebra, chapter 14. Elsevier, Amsterdam, The Netherlands, pp. 873–944, doi:10.1016/B978-044482830-9/50032-1.
  6. Bernardo David, Peter Gaži, Aggelos Kiayias & Alexander Russell (2018): Ouroboros Praos: An Adaptively-Secure, Semi-Synchronous Proof-of-Stake Blockchain. In: Jesper Buus Nielsen & Vincent Rijmen: Advances in Cryptology – EUROCRYPT 2018, Lecture Notes in Computer Science 10821. Springer, Berlin/Heidelberg, Germany, pp. 66–98, doi:10.1007/978-3-319-78375-8_3. Available at https://iohk.io/en/research/library/papers/ouroboros-praosan-adaptively-securesemi-synchronous-proof-of-stake-protocol/.
  7. Pierpaolo Degano, Rocco De Nicola & Ugo Montanari (1988): A Distributed Operational Semantics for CCS Based on Condition/Event Systems. Acta Informatica 26(1–2), pp. 59–91, doi:10.1007/BF02915446.
  8. Roberto Gorrieri (2017): Process Algebras for Petri Nets. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Berlin/Heidelberg, Germany, doi:10.1007/978-3-319-55559-1.
  9. Kohei Honda & Mario Tokoro (1991): An Object Calculus for Asynchronous Communication. In: Pierre America: ECOOP '91 European Conference on Object-Oriented Programming, Lecture Notes in Computer Science 512. Springer, Berlin/Heidelberg, Germany, pp. 133–147, doi:10.1007/BFb0057019.
  10. Aggelos Kiayias, Alexander Russell, Bernardo David & Roman Oliynykov (2017): Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol. In: Jonathan Katz & Hovav Shacham: Advances in Cryptology – CRYPTO 2017, Lecture Notes in Computer Science 10401. Springer, Berlin/Heidelberg, Germany, pp. 357–388, doi:10.1007/978-3-319-63688-7_12. Available at https://iohk.io/en/research/library/papers/ouroborosa-provably-secure-proof-of-stake-blockchain-protocol/.
  11. Ernst-Rüdiger Olderog (1991): Nets, Terms and Formulas. Cambridge Tracts in Theoretical Computer Science 23. Cambridge University Press, Cambridge, England, doi:10.1017/CBO9780511526589.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org