E R Olderog (49 results)

Condition: very good. Gut/Very good: Buch bzw. Schutzumschlag mit wenigen Gebrauchsspuren an Einband, Schutzumschlag oder Seiten. / Describes a book or dust jacket that does show some signs of wear on either the binding, dust jacket or pages.

Hardcover. Condition: Très bon. Ancien livre de bibliothèque avec équipements. Edition 1991. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 1991. Ammareal gives back up to 15% of this item's net price to charity organizations.

Softvover. 75 p. Except the named artical you find other scientifical dues as well. Very good condition! zqx Sprache: Englisch Gewicht in Gramm: 330.

Hardcover. Condition: Very Good. Dust Jacket Condition: No Dust Jacket. Hardcover, printed boards, without jacket; Cambridge Tracts in Theoretical Computer Science 23. One or two minor marks on boards; leading corners slightly worn; spine ends bumped. Pages clean throughout with sound binding; all content clear. TS. Used.

Hardcover. Condition: Très bon. Ancien livre de bibliothèque. Edition 1991. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 1991. Ammareal gives back up to 15% of this item's net price to charity organizations.

Condition: Gut. 278 Seiten ex Library Book / aus einer wissenschafltichen Bibliothek / Sprache: Englisch Gewicht in Gramm: 969 24,8 x 17,2 x 2,0 cm, Gebundene Ausgabe.

Softcover/Paperback. Condition: Sehr gut. Revised ed. 280 p. Very good. Shrink wrapped. / Sehr guter Zustand. In Folie verschweißt. Sprache: Englisch Gewicht in Gramm: 505.

Condition: Sehr gut. Zustand: Sehr gut | Seiten: 280 | Sprache: Englisch | Produktart: Bücher.

Condition: New. pp. xvi + 320 Illus.

Condition: New. pp. xvi + 320.

Condition: New. pp. xvi + 320.

Paperback. Condition: New.

Condition: New. In.

Condition: New.

Condition: New.

Paperback. Condition: new. Paperback. 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 future research. The book is written for graduate students and researchers in computer science; the author assumes a basic understanding of mathematical terminology, predicate logic and programming, but develops the semantic concepts used in a self-contained manner. The core of the material can be used for a one-semester course on concurrent processes. The book is self-contained in the semantics used, and will be of considerable interest to researchers and graduates in computer science working in models of concurrency. The author presents a theory whereby nets, terms and formulas represent concurrent process at three levels of abstractions: Petri nets are used to describe all details of the operational machine behavior of processes. Algebraic process terms such as Calculus of Communicating Systems (CCS) or Communicating Sequential Processes (CSP) two of the main models for parallel programming, are used to describe the architecture of processes, i.e. how they can be composed from subprocesses. Logical formulas of a first-order trace logic are used to describe the safety and liveness aspects of the communication behavior of processes as required by their users. The main emphasis and technical contribution of this theory are transformations for a top-down design of concurrent processes starting with formulas and proceeding through terms to nets. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Condition: As New. Unread book in perfect condition.

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: As New. Unread book in perfect condition.

Condition: New. pp. 280.

Condition: Brand New. Brand New! Fast Delivery, Delivery With In 7-10 working Day Only , USA Edition Original Edition. Excellent Quality, Printing In English Language, Quick delivery by FEDEX & DHL. USPS & UPS Act. Our courier service is not available at PO BOX& APO BOX. Ship from India & United States.

Condition: New.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - The author presents a theory whereby nets, terms and formulas represent concurrent processes at three levels of abstraction.

Paperback. Condition: new. Paperback. 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 future research. The book is written for graduate students and researchers in computer science; the author assumes a basic understanding of mathematical terminology, predicate logic and programming, but develops the semantic concepts used in a self-contained manner. The core of the material can be used for a one-semester course on concurrent processes. The book is self-contained in the semantics used, and will be of considerable interest to researchers and graduates in computer science working in models of concurrency. The author presents a theory whereby nets, terms and formulas represent concurrent process at three levels of abstractions: Petri nets are used to describe all details of the operational machine behavior of processes. Algebraic process terms such as Calculus of Communicating Systems (CCS) or Communicating Sequential Processes (CSP) two of the main models for parallel programming, are used to describe the architecture of processes, i.e. how they can be composed from subprocesses. Logical formulas of a first-order trace logic are used to describe the safety and liveness aspects of the communication behavior of processes as required by their users. The main emphasis and technical contribution of this theory are transformations for a top-down design of concurrent processes starting with formulas and proceeding through terms to nets. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Paperback. Condition: new. Paperback. 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 future research. The book is written for graduate students and researchers in computer science; the author assumes a basic understanding of mathematical terminology, predicate logic and programming, but develops the semantic concepts used in a self-contained manner. The core of the material can be used for a one-semester course on concurrent processes. The book is self-contained in the semantics used, and will be of considerable interest to researchers and graduates in computer science working in models of concurrency. The author presents a theory whereby nets, terms and formulas represent concurrent process at three levels of abstractions: Petri nets are used to describe all details of the operational machine behavior of processes. Algebraic process terms such as Calculus of Communicating Systems (CCS) or Communicating Sequential Processes (CSP) two of the main models for parallel programming, are used to describe the architecture of processes, i.e. how they can be composed from subprocesses. Logical formulas of a first-order trace logic are used to describe the safety and liveness aspects of the communication behavior of processes as required by their users. The main emphasis and technical contribution of this theory are transformations for a top-down design of concurrent processes starting with formulas and proceeding through terms to nets. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Condition: New.

Condition: New. Brand New! Fast Delivery US Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 6-12 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.