Sökt på: Serie monographs in theoretical computer science. an eatcs series
totalt 87 träffar
Coloured Petri Nets
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 …
Structural Complexity II
This is the second volume of a two volume collection on Structural Complexity. This volume assumes as a prerequisite knowledge about the topics treated in Volume I, but the present …
Stochastic Coalgebraic Logic
Coalgebraic logic is an important research topic in the areas of concurrency theory, semantics, transition systems and modal logics. It provides a general approach to modeling …
Products of Automata
Both theoretical and practical considerations motivate the repre sentation of objects as certain compositions of simpler ones. In the theory of automata this observation has led …
Theory of Semi-Feasible Algorithms
The primary goal of this book is unifying and making more widely accessible the vibrant stream of research - spanning more than two decades - on the theory of semi-feasible …
Fundamentals of Algebraic Specification 1
The aim of this book is to present fundamentals of algebraic specifications with respect to the following three aspects: fundamentals in the sense of a carefully motivated …
Deterministic Extraction from Weak Random Sources
A deterministic extractor is a function that extracts almost perfect random bits from a weak random source. In this research monograph the author constructs deterministic …
Unfoldings
In this book the authors introduce unfoldings, an approach to model checking which alleviates the state explosion problem by means of concurrency theory. They offer an introduction …
Handbook of Weighted Automata
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 …
Theoretical Aspects of Distributed Computing in Sensor Networks
Wireless ad hoc sensor networks has recently become a very active research subject. Achieving efficient, fault-tolerant realizations of very large, highly dynamic, complex, …
Fault-Tolerant Search Algorithms
Why a book on fault-tolerant search algorithms? Searching is one of the fundamental problems in computer science. Time and again algorithmic and combinatorial issues originally …
Patterns in Permutations and Words
There has been considerable 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 …