Taubner A (30 results)

Condition: very_good. Gently read. May have name of previous ownership, or ex-library edition. Binding tight; spine straight and smooth, with no creasing; covers clean and crisp. Minimal signs of handling or shelving. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships USPS Media Mail.…

paperback. Condition: Very Good. Shipped within 24 hours from our UK warehouse. Clean, undamaged book with no damage to pages and minimal wear to the cover. Spine still tight, in very good condition. Remember if you are not happy, you are covered by our 100% money back guarantee.

Condition: Good. 1989th Edition. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. …

Paperback. Condition: New.

Condition: Good. Paperback, illustraties (waaronder foto's) in kleur, 4to.

Condition: New.

Paperback or Softback. Condition: New. Finite Representations of CCS and Tcsp Programs by Automata and Petri Nets. Book.

Condition: New.

Condition: Gut. 15 x 12 cm. 119 (1) S. Mit 58 Abb. Originalkarton (Softcover). Deckel mit leichten Bügen.

Condition: New. In English.

PF. Condition: New.

Condition: New.

Paperback with flaps. Condition: As New. As new paperback with flaps. Mit faltanleitungen auf DVD.

paperback. Condition: Very Good. Surfing the Internet with Netscape Communicator 4 + CD (Paper Only) This book is in very good condition and will be shipped within 24 hours of ordering. The cover may have some limited signs of wear but the pages are clean, intact and the spine remains undamaged. This book has clearly been well maintained and looked after thus far. Money back guarantee if you are not satisfied. See all our books here, order more than 1 book and get discounted shipping. . …

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This work relates different approaches for the modelling of parallel processes. On the one hand there are theso-called 'process algebras' or 'abstract programming languages' with Milner's Calculus of Communicating Systems (CCS) and the theoretical version of Hoare's Communicating Sequential Processes (CSP) as main representatives. On the other hand there are machine models, i.e. the classical finite state automata (transition systems), for which, however, more discriminating notions of equivalence than equality of languages are used; and secondly, there are differently powerful types of Petri nets, namely safe and general (place/transition) nets respectively, and predicate/transition nets. Within a uniform framework the syntax and the operational semantics of CCS and TCSP are explained. We consider both, Milner's well-known interleaving semantics, which is based on infinite transition systems, as well as the new distributed semantics introduced by Degano et al., which is based on infinite safe nets. The main part of this work contains three syntax-driven constructions of transition systems, safe nets, and predicate/transition nets respectively. Each of them is accompanied by a proof of consistency. Due to intrinsic limits, which are also investigated here, neither for transition systems and finite nets, nor for general nets does a finite consistent representation of all CCS and TCSP programs exist. However sublanguages which allow finite representations are discerned. On the other hand the construction of predicate/transition nets is possible for all CCS programs in which every choice and every recursive body starts sequentially.…

Condition: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | This work relates different approaches for the modelling of parallel processes. On the one hand there are the so-called "process algebras" or "abstract programming languages" with Milner's Calculus of Communicating Systems (CCS) and the theoretical version of Hoare's Communicating Sequential Processes (CSP) as main representatives. On the other hand there are machine models, i.e. the classical finite state automata (transition systems), for which, however, more discriminating notions of equivalence than equality of languages are used; and secondly, there are differently powerful types of Petri nets, namely safe and general (place/transition) nets respectively, and predicate/transition nets. Within a uniform framework the syntax and the operational semantics of CCS and TCSP are explained. We consider both, Milner's well-known interleaving semantics, which is based on infinite transition systems, as well as the new distributed semantics introduced by Degano et al., which is based on infinite safe nets. The main part of this work contains three syntax-driven constructions of transition systems, safe nets, and predicate/transition nets respectively. Each of them is accompanied by a proof of consistency. Due to intrinsic limits, which are also investigated here, neither for transition systems and finite nets, nor for general nets does a finite consistent representation of all CCS and TCSP programs exist. However sublanguages which allow finite representations are discerned. On the other hand the construction of predicate/transition nets is possible for all CCS programs in which every choice and every recursive body starts sequentially.…

Condition: As New. Unread book in perfect condition.

Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condition: As New. Unread book in perfect condition.

ca. 22 x 17 cm, Broschiert. Condition: Gut. Sternkreationen, Aurelio Sport 64 S. Fachbuch / Sachbuch aus dem Bereich Basteln / Handarbeit / Origami; reichhaltig illustriert; gut erhalten An staatliche Organisationen und Einrichtungen, auch an Bibliotheken, versenden wir im Inland gern auf Rechnung. Sprache: Deutsch Gewicht in Gramm: 265. …

Orig.kartoniert. 220,(2) Seiten. Gr.-8°. Gut erhalten. ISBN 3923243413.

Buch. Condition: Neu. Origami to go | Das Falt-Buch für jede Tasche. Pocket-Format mit verdeckter Spiralbindung | Inge Täubner (u. a.) | Buch | to go | 160 S. | Deutsch | 2022 | frechverlag GmbH | EAN 9783735850461 | Verantwortliche Person für die EU: frechverlag GmbH, Dieselstr. 5, 70839 Gerlingen, produktsicherheit[at]frechverlag[dot]de | Anbieter: preigu. …

Taschenbuch. Condition: Neu. Mentalisierungsbasierte Therapie für Adoleszente (MBT-A) | Svenja Taubner (u. a.) | Taschenbuch | Psychodynamik kompakt | 86 S. | Deutsch | 2016 | Vandenhoeck + Ruprecht | EAN 9783525405765 | Verantwortliche Person für die EU: Vandenhoeck & Ruprecht, Theaterstr. 13, 37073 Göttingen, ute[dot]schnueckel[at]brill[dot]com | Anbieter: preigu. …

Taschenbuch. Condition: Neu. Mentalisierungsbasierte Therapie | Svenja Taubner (u. a.) | Taschenbuch | Fortschritte der Psychotherapie | VI | Deutsch | 2019 | Hogrefe Verlag GmbH + Co. | EAN 9783801728342 | Verantwortliche Person für die EU: Hogrefe Verlag GmbH & Co. KG, Merkelstr. 3, 37085 Göttingen, info[at]hogrefe[dot]de | Anbieter: preigu.…

Paperback. Condition: New.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This work relates different approaches for the modelling of parallel processes. On the one hand there are theso-called 'process algebras' or 'abstract programming languages' with Milner's Calculus of Communicating Systems (CCS) and the theoretical version of Hoare's Communicating Sequential Processes (CSP) as main representatives. On the other hand there are machine models, i.e. the classical finite state automata (transition systems), for which, however, more discriminating notions of equivalence than equality of languages are used; and secondly, there are differently powerful types of Petri nets, namely safe and general (place/transition) nets respectively, and predicate/transition nets. Within a uniform framework the syntax and the operational semantics of CCS and TCSP are explained. We consider both, Milner's well-known interleaving semantics, which is based on infinite transition systems, as well as the new distributed semantics introduced by Degano et al., which is based on infinite safe nets. The main part of this work contains three syntax-driven constructions of transition systems, safe nets, and predicate/transition nets respectively. Each of them is accompanied by a proof of consistency. Due to intrinsic limits, which are also investigated here, neither for transition systems and finite nets, nor for general nets does a finite consistent representation of all CCS and TCSP programs exist. However sublanguages which allow finite representations are discerned. On the other hand the construction of predicate/transition nets is possible for all CCS programs in which every choice and every recursive body starts sequentially. 184 pp. Englisch.…

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This work relates different approaches for the modelling of parallel processes. On the one hand there are the so-called process algebras or abstract programming languages with Milner s Calculus of Communicating Systems (CCS) and the theoretical version .…

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This work relates different approaches for the modelling of parallel processes. On the one hand there are the so-called 'process algebras' or 'abstract programming languages' with Milner's Calculus of Communicating Systems (CCS) and the theoretical version of Hoare's Communicating Sequential Processes (CSP) as main representatives. On the other hand there are machine models, i.e. the classical finite state automata (transition systems), for which, however, more discriminating notions of equivalence than equality of languages are used; and secondly, there are differently powerful types of Petri nets, namely safe and general (place/transition) nets respectively, and predicate/transition nets. Within a uniform framework the syntax and the operational semantics of CCS and TCSP are explained. We consider both, Milner's well-known interleaving semantics, which is based on infinite transition systems, as well as the new distributed semantics introduced by Degano et al., which is based on infinite safe nets. The main part of this work contains three syntax-driven constructions of transition systems, safe nets, and predicate/transition nets respectively. Each of them is accompanied by a proof of consistency. Due to intrinsic limits, which are also investigated here, neither for transition systems and finite nets, nor for general nets does a finite consistent representation of all CCS and TCSP programs exist. However sublanguages which allow finite representations are discerned. On the other hand the construction of predicate/transition nets is possible for all CCS programs in which every choice and every recursive body starts sequentially.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 184 pp. Englisch.…

Taschenbuch. Condition: Neu. Finite Representations of CCS and TCSP Programs by Automata and Petri Nets | Dirk A. Taubner | Taschenbuch | Einband - flex.(Paperback) | Englisch | 1989 | Springer | EAN 9783540515258 | Verantwortliche Person für die EU: Springer Nature Customer Service Center GmbH, Europaplatz 3, 69115 Heidelberg, productsafety[at]springernature[dot]com | Anbieter: preigu Print on Demand. …

Condition: New. PRINT ON DEMAND pp. 184.