Bücher der Reihe Monographs in Theoretical Computer Science. An EATCS Series

¿Congestion games are a fundamental class of games widely considered and studied in non-cooperative game theory, introduced to model several realistic scenarios in which people share a limited quantity of goods or services. In congestion games there are several selfish players competing for a set of resources, and each resource incurs a certain latency, expressed by a congestion-dependent function, to the players using it. Each player has a certain weight and an available set of strategies, where each strategy is a non-empty subset of resources, and aims at choosing a strategy minimizing her personal cost, which is defined as the sum of the latencies experienced on all the selected resources. The impact of selfish behavior in congestion games generally deteriorates the social welfare, thus reducing their performance. This deterioration is generally estimated by the price of anarchy, a metric that compares the worst Nash equilibrium configuration with the optimal social welfare, so that the larger the price of anarchy for a game, the higher the impact of selfish behavior. The book derives from the first author's thesis, which won the Best Italian PhD Thesis in Theoretical Computer Science in 2019, awarded by the Italian chapter of the EATCS. The book will be revised for broader audience, and the thesis supervisor is joining as coauthor following the suggestion of the series. The authors will introduce examples for initial definitions with detailed explanations, and expand the scope to the broader results in the area rather than their specific work.

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.The author's maxim is that before software can be designed we must understand its requirements, and before requirements can be prescribed we must analyse and describe the domain for which the software is intended. He does this by focusing on what it takes to analyse and describe domains. By a domain we understand a rationally describable discrete dynamics segment of human activity, of natural and man-made artefacts, examples include road, rail and air transport, container terminal ports, manufacturing, trade, healthcare, and urban planning. The book addresses issues of seemingly large systems, not small algorithms, and it emphasizes descriptionsas formal, mathematical quantities.This is the first thorough monograph treatment of the new software engineering phase of software development, one that precedes requirements engineering. It emphasizes a methodological approach by treating, in depth, analysis and description principles, techniques and tools. It does this by basing its domain modeling on fundamental philosophical principles, a view that is new for a computer science monograph.The book will be of value to computer scientists engaged with formal specifications of software. The author reveals this as a field of interesting problems, most chapters include pointers to further study and exercises drawn from practical engineering and science challenges. The text is supported by a primer to the formal specification language RSL and extensive indexes.

This book is concerned with a number of theories that can be used for describ­ ing and analyzing systems of interacting components in case it is desirable or necessary to regard their time-dependent behavior. Society is becoming increasingly more dependent on complex computer­ based systems that are composed of several components that act concurrently and interact - to synchronize and communicate with each other. The com­ plexity of these systems arises to a great extent from the many ways in which their components can interact. The need that these components act and in­ teract on time as well adds considerably to the complexity. In developing such a system, it is important to be able to acquire a better understanding of the relevant issues at the conceptual level, to describe the system in a precise way at various levels of detail, and to analyze it on the basis of the descriptions. When the early algebraic theories about processes, such as ACP [16, 17, 20], CCS [49, 50] and CSP [27, 39], were developed for that purpose, the established opinion was still that timing is a concern that can more often than not be treated independently. It is therefore not surprising that timing is deliberately ignored in those theories. They have now all been extended to deal with timing.

Cryptography, secret writing, is probably as old as writing itself. But only recently has it become the object of extensive scientific studies. Vast new applications to data security are one explanation for this. Perhaps a more important reason for the huge growth of scientific research on cryptography is the seminal idea of public-key cryptography and the resulting new vistas on the possibilities of communication. This book gives a broad overview of public-key cryptography, covering its essence and advantages, various public-key cryptosystems and protocols. It also gives a comprehensive introduction to classical cryptography and cryptanalysis. The book is self-contained and suitable both as a text and as a reference. It starts from the beginning but also includes some 1989 developments. The presentation is in many ways new, with some new results. The treatment is rigorous but avoids unnecessary formalism. The plaintext examples in the book form a package of basic sauna knowledge.

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.

This book deals with the problem of finding suitable languages that can represent specific classes of Petri nets, the most studied and widely accepted model for distributed systems.

This book is a comprehensive explanation of graph and model transformation. Then in the main part the book contains detailed chapters on M-adhesive categories, M-adhesive transformation systems, and multi-amalgamated transformations, and model transformation based on triple graph grammars.

At least four research fields detennine the theoretical background of specification and deduction in computer science: recursion theory, automated theorem proving, abstract data types and tenn rewriting systems.

Other approaches based on partially ordered sets - such as the theory of traces, the theory of event structures and the theory of semi words - are not considered in this book, in spite of the strong links between them and net theory.

The aim of this book is to present fundamentals of algebraicspecifications with respect to the following three aspects:fundamentals in the sense of a carefully motivatedintroduction to algebraic specifications, which is easy tounderstand for computer scientists and mathematicians;

Since the early seventies concepts of specification have become central in the whole area of computer science. The fundamentals of algebraic specification lay a basis for teaching, research, and development in all those fields of computer science where algebraic techniques are the subject or are used with advantage on a conceptual level.

In this book the authors introduce unfoldings, an approach to model checking which alleviates the state explosion problem by means of concurrency theory.

There has been much interest recently in the subject of patterns in permutations and words, a new branch of combinatorics with its roots in the works of Rotem, Rogers and Knuth. This comprehensive reference volume collects the main results in the field.

This book provides foundations for software specification and formal software development from the perspective of work on algebraic specification. It concentrates on developing basic concepts and studying their fundamental properties.

This book examines approaches to fault-tolerance in the context of algorithmic search theory. It details the application of fault-tolerant search procedures to specific problems in distributed computing, bioinformatics and computational learning.

In this research monograph, the author constructs deterministic extractors for several types of sources, using a methodology of recycling randomness which enables increasing the output length of deterministic extractors to near optimal length.

This work presents a purely classical first-order logical approach to the field of study in theoretical computer science sometimes referred to as the theory of programs, or programming theory.