Monographs in Theoretical Computer Science An EATCS Series - Böcker

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.

Läs mer »

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.

Läs mer »

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 ther...

Läs mer »

?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.

Läs mer »

This is the first comprehensive introduction to the theory of word-representable graphs, a generalization of several classical classes of graphs, and a new topic in discrete mathematics. After extensive introductory chapters that explain the conte...

Läs mer »

This is the first comprehensive introduction to the theory of word-representable graphs, a generalization of several classical classes of graphs, and a new topic in discrete mathematics. After extensive introductory chapters that explain the conte...

Läs mer »

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. Hence, the contribution of this book amounts to the alphabetizati...

Läs mer »

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. Hence, the contribution of this book amounts to the alphabetizati...

Läs mer »

Replacement systems, such as term rewriting systems, tree manipulat ing systems, and graph grammars, have been used in Computer Science in the context of theorem proving, program optimization, abstract data types, algebraic simplification, and sym...

Läs mer »

The theory of parsing is an important application area of the theory of formal languages and automata. The evolution of modem high-level programming languages created a need for a general and theoretically dean methodology for writing compilers fo...

Läs mer »

Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older f...

Läs mer »

Graphs are widely used to represent structural information in the form of objects and connections between them. Graph transformation is the rule-based manipulation of graphs, an increasingly important concept in computer science and related fields...

Läs mer »

Local search has been applied successfully to a diverse collection of optimization problems. It's appreciated for its basic conceptual foundation, its general applicability, and its power to serve as a source for new search paradigms. The typical ...

Läs mer »

In a model-based development of software systems different views on a system are elaborated using appropriate modeling languages and techniques. Because of the unavoidable heterogeneity of the viewpoint models, a semantic integration is required, ...

Läs mer »

Duration calculus constitutes a formal approach to the development of real-time systems; as an interval logic with special features for expressing and analyzing time durations of states in real-time systems, it allows for representing and formally...

Läs mer »

The construction of any broadly understood theory of information or infor mation processing system involves two major methodological processes: (1) abstraction and analysis, (2) reasoning and computing. This monograph is a realisation of these two...

Läs mer »

An Invitation to the Dance It is an underappreciated fact that sets may have various types of complex ity, and not all types are in harmony with each other. The primary goal of this book is to unify and make more widely accessible a vibrant stream...

Läs mer »

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 d...

Läs mer »

The OrIgIn of this monograph is a course entitled "Semantics directed Compiler Generation" which Professor Neil D. Jones gave in 1982 at Copenhagen University, where I was a student at the time. In this course, he described a compiler generator, c...

Läs mer »

This work is Volume II of a two-volume monograph on the theory of deterministic parsing of context-free grammars. Volume I, "Languages and Parsing" (Chapters 1 to 5), was an introduction to the basic concepts of formal language theory and context-...

Läs mer »

Since the early seventies concepts of specification have become central in the whole area of computer science. Especially algebraic specification techniques for abstract data types and software systems have gained considerable importance in recent...

Läs mer »

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. This field essentially attempts to provide a precise m...

Läs mer »

This three-volume work presents a coherent description of the theoretical and practical aspects of coloured Petri nets (CP-nets). The second volume contains a detailed presentation of the analysis methods for CP-nets. They allow the modeller to in...

Läs mer »

This three-volume work presents a coherent description of the theoretical and practical aspects of coloured Petri nets. These CP-nets are shown to be a full-fledged language for the design, specification, simulation, validation and implementation ...

Läs mer »

Restricted-orientation convexity is the study of geometric objects whose intersections with lines from some fixed set are connected. This notion generalizes standard convexity and several types of nontraditional convexity. We explore the propertie...

Läs mer »

In modern society services and support provided by computer-based systems have become ubiquitous and indeed have started to fund amentally alter the way people conduct their business. Moreover, it has become apparent that among the great variety o...

Läs mer »

Time-dependent scheduling involves problems in which the processing times of jobs depend on when those jobs are started. This book is a comprehensive study of complexity results and optimal and suboptimal algorithms concerning time-dependent sched...

Läs mer »

By a specification language we understand a formal system of syntax, semantics and proof rules. The syntax and semantics define a language; the proof rules define a proof system. Specifications are expressions in the language, and reasoning over p...

Läs mer »

Model checking is a prominent technique used in the hardware and software industries for automatic verification. While it is very successful in finding subtle bugs in distributed systems, it faces the state explosion problem - the number of reacha...

Läs mer »

The purpose of this Handbook is to highlight both theory and applications of weighted automata. Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, e. g. , the co...

Läs mer »