Atjaunināt sīkdatņu piekrišanu

Introduction to Process Algebra Softcover reprint of hardcover 1st ed. 2000 [Mīkstie vāki]

  • Formāts: Paperback / softback, 168 pages, height x width: 235x155 mm, weight: 454 g, VIII, 168 p., 1 Paperback / softback
  • Sērija : Texts in Theoretical Computer Science. An EATCS Series
  • Izdošanas datums: 07-Dec-2010
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642085849
  • ISBN-13: 9783642085840
  • Mīkstie vāki
  • Cena: 46,91 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 55,19 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 168 pages, height x width: 235x155 mm, weight: 454 g, VIII, 168 p., 1 Paperback / softback
  • Sērija : Texts in Theoretical Computer Science. An EATCS Series
  • Izdošanas datums: 07-Dec-2010
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642085849
  • ISBN-13: 9783642085840
Automated and semi-automated manipulation of so-called labelled transition systems has become an important means in discovering flaws in software and hardware systems. Process algebra has been developed to express such labelled transition systems algebraically, which enhances the ways of manipulation by means of equational logic and term rewriting. The theory of process algebra has developed rapidly over the last twenty years, and verification tools have been developed on the basis of process algebra, often in cooperation with techniques related to model checking. This textbook gives a thorough introduction into the basics of process algebra and its applications.

Papildus informācija

Springer Book Archives
1. Introduction.-
2. Basic Process Algebra.-
3. Algebra of Communicating Processes.-
4. Recursion.-
5. Abstraction.-
6. Protocol Verifications.-
7. Extensions.- A. Equational Logic.- B. Structural Operational Semantics.- Solutions to Selected Exercises.- References.