Muutke küpsiste eelistusi

Introduction to Process Algebra 2000 ed. [Kõva köide]

  • Formaat: Hardback, 168 pages, kõrgus x laius: 235x155 mm, kaal: 950 g, VIII, 168 p., 1 Hardback
  • Sari: Texts in Theoretical Computer Science. An EATCS Series
  • Ilmumisaeg: 23-Dec-1999
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 354066579X
  • ISBN-13: 9783540665793
  • Kõva köide
  • Hind: 48,70 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 57,29 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Hardback, 168 pages, kõrgus x laius: 235x155 mm, kaal: 950 g, VIII, 168 p., 1 Hardback
  • Sari: Texts in Theoretical Computer Science. An EATCS Series
  • Ilmumisaeg: 23-Dec-1999
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 354066579X
  • ISBN-13: 9783540665793
The theory or 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 an introduction into the basics of process algebra and its applications.

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.
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.