東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁 到查詢結果 [ author_sort:"gorrieri, roberto." ]

切換: 標籤 | MARC模式 | ISBD

Process algebras for Petri nets = th...

Gorrieri, Roberto.

FindBook

Google Book

Amazon

博客來

Process algebras for Petri nets = the alphabetization of distributed systems /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Process algebras for Petri nets/ by Roberto Gorrieri.
其他題名:	the alphabetization of distributed systems /
作者:	Gorrieri, Roberto.
出版者:	Cham :Springer International Publishing : : 2017.,
面頁冊數:	xiii, 302 p. :ill., digital ;24 cm.
內容註:	Introduction -- Transition Systems -- Petri Nets -- The Basic Calculus: SFM -- Adding Asynchronous Parallel Composition: CFM and BPP -- Adding Communication and Restriction: FNC -- Adding Multi-party Communication: FNM -- Adding Atomic Tests for Absence: NPL -- Generalizations and Conclusions.
Contained By:	Springer eBooks
標題:	Petri nets. -
電子資源:	http://dx.doi.org/10.1007/978-3-319-55559-1
ISBN:	9783319555591

Process algebras for Petri nets = the alphabetization of distributed systems /
Gorrieri, Roberto.

Process algebras for Petri netsthe alphabetization of distributed systems /[electronic resource] :by Roberto Gorrieri. - Cham :Springer International Publishing :2017. - xiii, 302 p. :ill., digital ;24 cm. - Monographs in theoretical computer science. An EATCS series,1431-2654. - Monographs in theoretical computer science. An EATCS series..

Introduction -- Transition Systems -- Petri Nets -- The Basic Calculus: SFM -- Adding Asynchronous Parallel Composition: CFM and BPP -- Adding Communication and Restriction: FNC -- Adding Multi-party Communication: FNM -- Adding Atomic Tests for Absence: NPL -- Generalizations and Conclusions.

This book deals with the problem of finding suitable languages that can represent specific classes of Petri nets, the most studied and widely accepted model for distributed systems. Hence, the contribution of this book amounts to the alphabetization of some classes of distributed systems. The book also suggests the need for a generalization of Turing computability theory. It is important for graduate students and researchers engaged with the concurrent semantics of distributed communicating systems. The author assumes some prior knowledge of formal languages and theoretical computer science.

ISBN: 9783319555591

Standard No.: 10.1007/978-3-319-55559-1doiSubjects--Topical Terms:

654110
Petri nets.

LC Class. No.: QA267

Dewey Class. No.: 004.36

Process algebras for Petri nets = the alphabetization of distributed systems /
LDR:01989nmm a2200349 a 4500 001 2097379
003 DE-He213
005 20170413060224.0
006 m d
007 cr nn 008maaau
008 171229s2017 gw s 0 eng d
020 $a 9783319555591 $q (electronic bk.)
020 $a 9783319555584 $q (paper)
024 7 $a 10.1007/978-3-319-55559-1 $2 doi
035 $a 978-3-319-55559-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267
072 7 $a UY $2 bicssc
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a COM031000 $2 bisacsh
082 0 4 $a 004.36 $2 23
090 $a QA267 $b .G673 2017
100 1 $a Gorrieri, Roberto. $3 812634
245 1 0 $a Process algebras for Petri nets $h [electronic resource] : $b the alphabetization of distributed systems / $c by Roberto Gorrieri.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2017.
300 $a xiii, 302 p. : $b ill., digital ; $c 24 cm.
490 1 $a Monographs in theoretical computer science. An EATCS series, $x 1431-2654
505 0 $a Introduction -- Transition Systems -- Petri Nets -- The Basic Calculus: SFM -- Adding Asynchronous Parallel Composition: CFM and BPP -- Adding Communication and Restriction: FNC -- Adding Multi-party Communication: FNM -- Adding Atomic Tests for Absence: NPL -- Generalizations and Conclusions.
520 $a This book deals with the problem of finding suitable languages that can represent specific classes of Petri nets, the most studied and widely accepted model for distributed systems. Hence, the contribution of this book amounts to the alphabetization of some classes of distributed systems. The book also suggests the need for a generalization of Turing computability theory. It is important for graduate students and researchers engaged with the concurrent semantics of distributed communicating systems. The author assumes some prior knowledge of formal languages and theoretical computer science.
650 0 $a Petri nets. $3 654110
650 0 $a Computer algorithms. $3 523872
650 0 $a Parallel processing (Electronic computers) $3 653284
650 0 $a Electronic data processing $x Distributed processing. $3 548601
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Theory of Computation. $3 892514
650 2 4 $a Mathematical Logic and Foundations. $3 892656
650 2 4 $a Software Engineering/Programming and Operating Systems. $3 891214
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Monographs in theoretical computer science. An EATCS series. $3 3236020
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-55559-1
950 $a Computer Science (Springer-11645)