This book provides foundations for software specification and formal software development from the perspective of work on algebraic specification, concentrating on developing basic concepts and studying their fundamental properties. These foundations are built on a solid mathematical basis, using elements of universal algebra, category theory and logic, and this mathematical toolbox provides a convenient language for precisely formulating the concepts involved in software specification and development. Once formally defined, these notions become subject to mathematical investigation, and...
This book provides foundations for software specification and formal software development from the perspective of work on algebraic specification, ...
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 systems, allowing us to apply important results from coalgebras, universal algebra and category theory in novel ways. Stochastic systems provide important tools for systems modeling, and recent work shows that categorical reasoning may lead to new insights, previously not available in a purely probabilistic setting.
This book combines coalgebraic reasoning, stochastic systems and logics. It provides an insight...
Coalgebraic logic is an important research topic in the areas of concurrency theory, semantics, transition systems and modal logics. It provides a ...
The purpose of this Handbook is to highlight both theory and applications of weighted automata. Weighted ?nite automata are classical nondeterministic ?nite automata in which the transitions carry weights. These weights may model, e. g., the cost involved when executing a transition, the amount of resources or time neededforthis, ortheprobabilityorreliabilityofitssuccessful execution. The behavior of weighted ?nite automata can then be considered as the function (suitably de?ned) associating with each word the weight of its execution. Clearly, weights can also be added to classical automata...
The purpose of this Handbook is to highlight both theory and applications of weighted automata. Weighted ?nite automata are classical nondeterministic...
The design and analysis of data structures and efficient algorithms has gained considerable importance in recent years. The concept of "algorithm" is central in computer science, and "efficiency" is central in the world of money. I have organized the material in three volumes and nine chapters. Vol. 1: Sorting and Searching (chapters I to III) Vol. 2: Graph Algorithms and NP-completeness (chapters IV to VI) Vol. 3: Multi-dimensional Searching and Computational G- metry (chapters VII and VIII) Volumes 2 and 3 have volume 1 as a common basis but are indepen dent from each other. Most of volumes...
The design and analysis of data structures and efficient algorithms has gained considerable importance in recent years. The concept of "algorithm" is ...
Automata theory is the oldest among the disciplines constituting the subject matter of this Monograph Series: theoretical computer science. Indeed, automata theory and the closely related theory of formal languages form nowadays such a highly developed and diversified body of knowledge that even an exposition of "reasonably important" results is not possible within one volume. The purpose of this book is to develop the theory of automata and formal languages, starting from ideas based on linear algebra. By what was said above, it should be obvious that we do not intend to be encyclopedic....
Automata theory is the oldest among the disciplines constituting the subject matter of this Monograph Series: theoretical computer science. Indeed, au...
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 introduction to algebraic specifications, which is easy to understand for computer scientists and mathematicians; fundamentals in the sense of mathematical theories which are the basis for precise definitions, constructions, results, and correctness proofs; and fundamentals in the sense of concepts, which are introduced on a conceptual level and formalized in mathematical terms. The book is equally suitableas a text book...
The aim of this book is to present fundamentals of algebraic specifications with respect to the following three aspects: fundamentals in the sense of ...
Intends to lay a common basis for the different branches of recursion theory. Leads from the very basic theory to modern concepts of computability. Consists of three consecutive parts: 1. Basic Concepts of Computability. 2. Traditional Recursion Theory. 3. Unified Type 2 theory of constructivity and computability on Baire's space including a general the- ory of representations.
Intends to lay a common basis for the different branches of recursion theory. Leads from the very basic theory to modern concepts of computability. Co...
Net theory is a theory of systems organization which had its origins, about 20 years ago, in the dissertation of C. A. Petri 1]. Since this seminal paper, nets have been applied in various areas, at the same time being modified and theoretically investigated. In recent time, computer scientists are taking a broader interest in net theory. The main concern of this book is the presentation of those parts of net theory which can serve as a basis for practical application. It introduces the basic net theoretical concepts and ways of thinking, motivates them by means of examples and derives...
Net theory is a theory of systems organization which had its origins, about 20 years ago, in the dissertation of C. A. Petri 1]. Since this seminal p...
