Domain Theory in Computer Science

The topics include: - Basic models of concurrency such as abstract machines, domain theoretic models, game theoretic models, process algebras, and Petri nets. - Logics for concurrency such as modal logics, probabilistic and stochastic logics, temporal logics, and resource logics.

In the past few decades, several interesting problems have been solved using fixed point theory. In addition to classical ordinary differential equations and integral equation, researchers also focus on fractional differential equations (FDE) and fractional integral equations (FIE). Indeed, FDE and FIE lead to a better understanding of several physical phenomena, which is why such differential equations have been highly appreciated and explored. We also note the importance of distinct abstract spaces, such as quasi-metric, b-metric, symmetric, partial metric, and dislocated metric. Sometimes, one of these spaces is more suitable for a particular application.

In this book the author explains domain engineering and the underlying science, and he then shows how we can derive requirements prescriptions for computing systems from domain descriptions. A further motivation is to present domain descriptions, requirements prescriptions, and software design specifications as mathematical quantities.