Bookbot

Významné dizertačné práce v informatike

Táto séria predstavuje výber najlepších britských dizertačných prác z oblasti informatiky, ktoré boli každoročne vyberané odbornou komisiou. Cieľom je zviditeľniť významné britské príspevky k tomuto odboru a slúžiť ako vzor pre budúcich študentov. Publikácie sa vyznačujú vysokou úrovňou spracovania a zasadzujú výsledky do širšieho kontextu informatiky.

Specification and Proof in Real Time CSP
Efficient Algorithms for Listing Combinatorial Structures

Odporúčané poradie čítania

  • Focusing on the design of efficient algorithms, this thesis explores methods for listing combinatorial structures. It delves into the intricacies of combinatorial design and algorithmic efficiency, providing insights that are essential for researchers and practitioners in the field. The work, first published in 1993, contributes to the understanding of how to effectively generate and manage combinatorial configurations.

    Efficient Algorithms for Listing Combinatorial Structures
  • Focusing on the specification and verification of real-time systems, this book delves into the application of Communicating Sequential Processes (CSP). It presents research findings that explore how CSP can be effectively utilized to ensure the reliability and correctness of systems that operate within strict timing constraints, making it a valuable resource for researchers and practitioners in the field of computer science and systems engineering.

    Specification and Proof in Real Time CSP