東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Transactions on petri nets and other...

Koutny, Maciej.

FindBook

Google Book

Amazon

博客來

Transactions on petri nets and other models of concurrency XV

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Transactions on petri nets and other models of concurrency XV/ edited by Maciej Koutny, Fabrice Kordon, Lucia Pomello.
其他題名:	Transactions on petri nets and other models of concurrency 15
其他作者:	Koutny, Maciej.
出版者:	Berlin, Heidelberg :Springer Berlin Heidelberg : : 2021.,
面頁冊數:	xvii, 185 p. :ill., digital ;24 cm.
內容註:	A Novel Token-Based Replay Technique to Speed Up Conformance Checking and Process Enhancement -- Extensible Structural Analysis of Petri Net Product Lines -- Stability of Regional Orthomodular Posets under Synchronisation and Refinement -- Efficient Synthesis of Weighted Marked Graphs with Circular Reachability Graph, and Beyond -- The Complexity of Synthesizing nop-Equipped Boolean Petri Nets from g-Bounded Inputs -- A Two-Player Asynchronous Game on Fully Observable Petri Nets -- Solving Finite-Linear-Path CTL-Formulas Using the CEGAR Approach -- Verification of the MQTT IoT Protocol Using Property-Specific CTL Sweep-Line Algorithms.
Contained By:	Springer Nature eBook
標題:	Petri nets - Congresses. -
電子資源:	https://doi.org/10.1007/978-3-662-63079-2
ISBN:	9783662630792

Transactions on petri nets and other models of concurrency XV
Transactions on petri nets and other models of concurrency XV[electronic resource] /Transactions on petri nets and other models of concurrency 15edited by Maciej Koutny, Fabrice Kordon, Lucia Pomello. - Berlin, Heidelberg :Springer Berlin Heidelberg :2021. - xvii, 185 p. :ill., digital ;24 cm. - Lecture notes in computer science,125300302-9743 ;. - Lecture notes in computer science ;12530..

A Novel Token-Based Replay Technique to Speed Up Conformance Checking and Process Enhancement -- Extensible Structural Analysis of Petri Net Product Lines -- Stability of Regional Orthomodular Posets under Synchronisation and Refinement -- Efficient Synthesis of Weighted Marked Graphs with Circular Reachability Graph, and Beyond -- The Complexity of Synthesizing nop-Equipped Boolean Petri Nets from g-Bounded Inputs -- A Two-Player Asynchronous Game on Fully Observable Petri Nets -- Solving Finite-Linear-Path CTL-Formulas Using the CEGAR Approach -- Verification of the MQTT IoT Protocol Using Property-Specific CTL Sweep-Line Algorithms.

These Transactions publish archival papers in the broad area of Petri nets and other models of concurrency, ranging from theoretical work to tool support and industrial applications. ToPNoC issues are published as LNCS volumes, and hence are widely distributed and indexed. This Journal has its own Editorial Board which selects papers based on a rigorous two-stage refereeing process. ToPNoC contains: Revised versions of a selection of the best papers from workshops and tutorials at the annual Petri Net conferences Special sections/issues within particular subareas (similar to those published in the Advances in Petri Nets series) Other papers invited for publication in ToPNoC Papers submitted directly to ToPNoC by their authors The 15th volume of ToPNoC contains revised and extended versions of a selection of the best workshop and tutorial papers presented at the 40th International Conference on Application and Theory of Petri Nets and Concurrency, Petri Nets 2019, and the 19th International Conference on Application of Concurrency to System Design, ACSD 2019. The papers cover a diverse range of topics including model checking and system verification, refinement and synthesis; foundational work on specific classes of Petri nets; and innovative applications of Petri nets and other models of concurrency. Application areas covered in this volume are: process mining, verification, formal semantics, communication protocols, business processes, distributed systems, and net synthesis. Thus, this volume gives a good overview of ongoing research on concurrent systems and Petri nets.

ISBN: 9783662630792

Standard No.: 10.1007/978-3-662-63079-2doiSubjects--Topical Terms:

663832
Petri nets
--Congresses.

LC Class. No.: QA267

Dewey Class. No.: 511.35

Transactions on petri nets and other models of concurrency XV
LDR:03507nmm a2200373 a 4500 001 2238058
003 DE-He213
005 20210224132315.0
006 m d
007 cr nn 008maaau
008 211111s2021 gw s 0 eng d
020 $a 9783662630792 $q (electronic bk.)
020 $a 9783662630785 $q (paper)
024 7 $a 10.1007/978-3-662-63079-2 $2 doi
035 $a 978-3-662-63079-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267
072 7 $a UY $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UY $2 thema
072 7 $a UYA $2 thema
082 0 4 $a 511.35 $2 23
090 $a QA267 $b .T772 2021
245 0 0 $a Transactions on petri nets and other models of concurrency XV $h [electronic resource] / $c edited by Maciej Koutny, Fabrice Kordon, Lucia Pomello.
246 3 $a Transactions on petri nets and other models of concurrency 15
260 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2021.
300 $a xvii, 185 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12530
490 1 $a Transactions on petri nets and other models of concurrency
505 0 $a A Novel Token-Based Replay Technique to Speed Up Conformance Checking and Process Enhancement -- Extensible Structural Analysis of Petri Net Product Lines -- Stability of Regional Orthomodular Posets under Synchronisation and Refinement -- Efficient Synthesis of Weighted Marked Graphs with Circular Reachability Graph, and Beyond -- The Complexity of Synthesizing nop-Equipped Boolean Petri Nets from g-Bounded Inputs -- A Two-Player Asynchronous Game on Fully Observable Petri Nets -- Solving Finite-Linear-Path CTL-Formulas Using the CEGAR Approach -- Verification of the MQTT IoT Protocol Using Property-Specific CTL Sweep-Line Algorithms.
520 $a These Transactions publish archival papers in the broad area of Petri nets and other models of concurrency, ranging from theoretical work to tool support and industrial applications. ToPNoC issues are published as LNCS volumes, and hence are widely distributed and indexed. This Journal has its own Editorial Board which selects papers based on a rigorous two-stage refereeing process. ToPNoC contains: Revised versions of a selection of the best papers from workshops and tutorials at the annual Petri Net conferences Special sections/issues within particular subareas (similar to those published in the Advances in Petri Nets series) Other papers invited for publication in ToPNoC Papers submitted directly to ToPNoC by their authors The 15th volume of ToPNoC contains revised and extended versions of a selection of the best workshop and tutorial papers presented at the 40th International Conference on Application and Theory of Petri Nets and Concurrency, Petri Nets 2019, and the 19th International Conference on Application of Concurrency to System Design, ACSD 2019. The papers cover a diverse range of topics including model checking and system verification, refinement and synthesis; foundational work on specific classes of Petri nets; and innovative applications of Petri nets and other models of concurrency. Application areas covered in this volume are: process mining, verification, formal semantics, communication protocols, business processes, distributed systems, and net synthesis. Thus, this volume gives a good overview of ongoing research on concurrent systems and Petri nets.
650 0 $a Petri nets $x Congresses. $3 663832
650 1 4 $a Theory of Computation. $3 892514
650 2 4 $a Data Structures. $3 891009
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
650 2 4 $a Software Engineering. $3 890874
650 2 4 $a Computer Systems Organization and Communication Networks. $3 891212
700 1 $a Koutny, Maciej. $3 1071953
700 1 $a Kordon, Fabrice. $3 827440
700 1 $a Pomello, Lucia. $3 3490835
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 12530. $3 3490836
830 0 $a Transactions on petri nets and other models of concurrency. $3 3490837
856 4 0 $u https://doi.org/10.1007/978-3-662-63079-2
950 $a Computer Science (SpringerNature-11645)