Nets, Terms and Formulas by E Olderog
The author presents a theory of concurrent processes where three different semantic description methods that are usually studied in isolation are brought together. Petri nets describe processes as concurrent and interacting machines; algebraic process terms describe processes as abstract concurrent processes; and logical formulas specify the intended communication behaviour of processes. At the heart of this theory are two sets of transformation rules for the top-down design of concurrent processes. The first set can be used to transform stepwise logical formulas into process terms, whilst process terms can be transformed into Petri nets by the second set. These rules are based on novel techniques for the operational and denotational semantics of concurrent processes. Various results and relationships between nets, terms and formulas starting with formulas and illustrated by examples. The use of transformations is demonstrated in a series of case studies, and the author also identifies directions for research.-
The Optimal Implementation of Functional Programming Languages
-
Mathematics for Computer Graphics
-
The Clausal Theory of Types
-
Basic Proof Theory
-
Process Algebra
-
Nonmonotonic Reasoning
-
Applications of Process Algebra
- Reasoning about Gossip
-
Belief Revision
-
Mathematical Theory of Domains
-
Process Algebra: Equational Theories of Communicating Processes
-
Initial Algebras and Terminal Coalgebras
-
Rippling: Meta-Level Guidance for Mathematical Reasoning
-
Finite-State Techniques
-
Higher Order Logic and Hardware Verification
-
Formal Methods in Artificial Intelligence
-
Hybrid Graph Theory and Network Analysis
-
Data Refinement
-
Lambda-calculus, Combinators and Functional Programming
-
A Unifying Framework for Structured Analysis and Design Models
-
Concurrency Verification
-
Design Theory and Computer Science
-
Computational Learning Theory
-
Metamathematics, Machines and Goedel's Proof
-
Formal Specification and Design
-
The Logic of Typed Feature Structures
-
Free Choice Petri Nets
-
Two-Level Functional Languages
-
Basic Simple Type Theory
-
Term Rewriting Systems
-
The Uncertain Reasoner's Companion
-
Deductive and Declarative Programming
-
Information Flow
-
Domains and Lambda-Calculi
-
Formal Semantics and Pragmatics for Natural Language Querying
"The unique feature of this book is that it unifies different views of concurrency rather than adding another viewThe author does so in a clear and convincing fashion....requires the reader to be fluent in such mathematical concepts as sets, relations, functions, and predicate logic, and to be familiar with the basic concepts of automata and regular languages. Readers who enjoy the mathematical maturity will find the book excellent: it is carefully written, and the material is presented in a well-chosen order and at the right level of detail. The author must be a good teacher." Martin Rem, Computing Reviews
| SKU | Unavailable |
| ISBN 13 | 9780521400442 |
| ISBN 10 | 0521400449 |
| Title | Nets, Terms and Formulas |
| Author | E Olderog |
| Series | Cambridge Tracts In Theoretical Computer Science |
| Condition | Unavailable |
| Binding Type | Hardback |
| Publisher | Cambridge University Press |
| Year published | 1991-10-03 |
| Number of pages | 278 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |