Petri Net Algebra (Monographs in Theoretical Computer Science) (2001. XI, 378 p. 24 cm)

個数:

Petri Net Algebra (Monographs in Theoretical Computer Science) (2001. XI, 378 p. 24 cm)

  • 在庫がございません。海外の書籍取次会社を通じて出版社等からお取り寄せいたします。
    通常6~9週間ほどで発送の見込みですが、商品によってはさらに時間がかかることもございます。
    重要ご説明事項
    1. 納期遅延や、ご入手不能となる場合がございます。
    2. 複数冊ご注文の場合、分割発送となる場合がございます。
    3. 美品のご指定は承りかねます。

  • 提携先の海外書籍取次会社に在庫がございます。通常3週間で発送いたします。
    重要ご説明事項
    1. 納期遅延や、ご入手不能となる場合が若干ございます。
    2. 複数冊ご注文の場合、分割発送となる場合がございます。
    3. 美品のご指定は承りかねます。
  • 【入荷遅延について】
    世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
    おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。
  • ◆画像の表紙や帯等は実物とは異なる場合があります。
  • ◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
    また、洋書販売価格は、ご注文確定時点での日本円価格となります。
    ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。
  • 製本 Hardcover:ハードカバー版/ページ数 380 p.
  • 商品コード 9783540673989

Full Description

In modern society services and support provided by computer-based systems have become ubiquitous and indeed have started to fund amentally alter the way people conduct their business. Moreover, it has become apparent that among the great variety of computer technologies available to potential users a crucial role will be played by concurrent systems. The reason is that many commonly occurring phenomena and computer applications are highly con­ current : typical examples include control systems, computer networks, digital hardware, business computing, and multimedia systems. Such systems are characterised by ever increasing complexity, which results when large num­ bers of concurrently active components interact. This has been recognised and addressed within the computing science community. In particular, sev­ eral form al models of concurrent systems have been proposed, studied, and applied in practice. This book brings together two of the most widely used formalisms for de­ scribing and analysing concurrent systems: Petri nets and process algebras. On the one hand , process algebras allow one to specify and reason about the design of complex concurrent computing systems by means of algebraic operators corresponding to common programming constructs. Petri nets, on the other hand, provide a graphical representation of such systems and an additional means of verifying their correctness efficiently, as well as a way of expressing properties related to causality and concurrency in system be­ haviour.

Contents

1. Introduction.- 2. The Petri Box Calculus.- 3. Syntax and Operational Semantics.- 4. Petri Net Semantics.- 5. Adding Recursion.- 6. S-invariants.- 7. The Box Algebra.- 8. PBC and Other Process Algebras.- 9. A Concurrent Programming Language.- 10. Conclusion.- Appendix: Solutions of Selected Exercises.- References.