Transactions on Petri Nets and Other Models of Concurrency XII

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

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Koutny, Maciej (Επιμελητής έκδοσης), Kleijn, Jetty (Επιμελητής έκδοσης), Penczek, Wojciech (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2017.
Σειρά:Lecture Notes in Computer Science, 10470
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04259nam a22005415i 4500
001 978-3-662-55862-1
003 DE-He213
005 20170919152728.0
007 cr nn 008mamaa
008 170919s2017 gw | s |||| 0|eng d
020 |a 9783662558621  |9 978-3-662-55862-1 
024 7 |a 10.1007/978-3-662-55862-1  |2 doi 
040 |d GrThAP 
050 4 |a QA76.758 
072 7 |a UMZ  |2 bicssc 
072 7 |a COM051230  |2 bisacsh 
082 0 4 |a 005.1  |2 23 
245 1 0 |a Transactions on Petri Nets and Other Models of Concurrency XII  |h [electronic resource] /  |c edited by Maciej Koutny, Jetty Kleijn, Wojciech Penczek. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2017. 
300 |a XVII, 217 p. 89 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 10470 
505 0 |a Properties of Plain, Pure, and Safe Petri Nets -- Similarity-based Approaches for Determining the Number of Trace Clusters in Process Discovery -- Log- and Model-Based Techniques for Security-Sensitive Tackling of Obstructed Workflow Executions -- Formal Modelling and Analysis of Distributed Storage Systems -- DB-Nets: on the Marriage of Colored Petri Nets and Relational Databases -- Transition Systems Reduction: Balancing between Precision and Simplicity -- Stubborn Set Intuition Explained -- Decomposed Replay Using Hiding and Reduction as Abstraction -- Multiplicative Transition Systems. 
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 co nferences e: 12.0pt;line-height: 115.0%;font-family: " times="" new="" roman"="" ,="" serif;"="">- 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. mal" style="margin-bottom: 0.0001pt;">The 12th volume of ToPNoC contains revised and extended versions of a selection of the best workshop papers presented at the 37th International Conference on Application and Theory of Petri Nets and Concurrency, Petri Nets 2016, and the 16th International Conference on Application of Concurrency to System Design, ACSD 2016. It also contains one paper submitted directly to ToPNoC. The 9 papers cover a diverse range of topics including model checking and sys tem 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: security, service composition, databases, communication protocols, business processes, and distributed systems. Thus, this volume gives a good overview of ongoing research on concurrent systems and Petri nets. 
650 0 |a Computer science. 
650 0 |a Software engineering. 
650 0 |a Data structures (Computer science). 
650 0 |a Algorithms. 
650 0 |a Computer logic. 
650 1 4 |a Computer Science. 
650 2 4 |a Software Engineering. 
650 2 4 |a Logics and Meanings of Programs. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Data Structures. 
700 1 |a Koutny, Maciej.  |e editor. 
700 1 |a Kleijn, Jetty.  |e editor. 
700 1 |a Penczek, Wojciech.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783662558614 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 10470 
856 4 0 |u http://dx.doi.org/10.1007/978-3-662-55862-1  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)