Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Application and theory of petri nets and concurrency : 43rd International Conference, PETRI NETS 2022, Bergen, Norway, June 19-24, 2022, proceedings / / Luca Bernardinello, Laure Petrucci, editors
| Application and theory of petri nets and concurrency : 43rd International Conference, PETRI NETS 2022, Bergen, Norway, June 19-24, 2022, proceedings / / Luca Bernardinello, Laure Petrucci, editors |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (398 pages) |
| Disciplina | 511.3 |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Computer multitasking
Petri nets |
| ISBN | 3-031-06653-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996478872203316 |
| Cham, Switzerland : , : Springer, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Effective Concurrency in Go : Develop, Analyze, and Troubleshoot High Performance Concurrent Applications with Ease
| Effective Concurrency in Go : Develop, Analyze, and Troubleshoot High Performance Concurrent Applications with Ease |
| Autore | Serdar Burak |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Birmingham : , : Packt Publishing, Limited, , 2023 |
| Descrizione fisica | 1 online resource (212 pages) |
| Disciplina | 005.133 |
| Soggetto topico |
Go (Computer program language)
Computer multitasking |
| ISBN |
9781804615980
1804615986 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Cover -- Title Page -- Copyright and Credit -- Dedicated -- Contributors -- Table of Contents -- Preface -- Chapter 1: Concurrency - A High-Level Overview -- Technical Requirements -- Concurrency and parallelism -- Shared memory versus message passing -- Atomicity, race, deadlocks, and starvation -- Summary -- Question -- Further reading -- Chapter 2: Go Concurrency Primitives -- Technical Requirements -- Goroutines -- Channels -- Mutex -- Wait groups -- Condition variables -- Summary -- Questions -- Chapter 3: The Go Memory Model -- Why a memory model is necessary -- The happened-before relationship between memory operations -- Synchronization characteristics of Go concurrency primitives -- Package initialization -- Goroutines -- Channels -- Mutexes -- Atomic memory operations -- Map, Once, and WaitGroup -- Summary -- Further reading -- Chapter 4: Some Well-Known Concurrency Problems -- Technical Requirements -- The producer-consumer problem -- The dining philosophers problem -- Rate limiting -- Summary -- Chapter 5: Worker Pools and Pipelines -- Technical Requirements -- Worker pools -- Pipelines, fan-out, and fan-in -- Asynchronous pipeline -- Fan-out/fan-in -- Fan-in with ordering -- Summary -- Questions -- Chapter 6: Error Handling -- Error handling -- Pipelines -- Servers -- Panics -- Summary -- Chapter 7: Timers and Tickers -- Technical Requirements -- Timers - running something later -- Tickers - running something periodically -- Heartbeats -- Summary -- Chapter 8: Handling Requests Concurrently -- Technical Requirements -- The context, cancelations, and timeouts -- Backend services -- Distributing work and collecting results -- Semaphores - limiting concurrency -- Streaming data -- Dealing with multiple streams -- Summary -- Chapter 9: Atomic Memory Operations -- Technical Requirements -- Memory guarantees -- Compare and swap.
Practical uses of atomics -- Counters -- Heartbeat and progress meter -- Cancellations -- Detecting change -- Summary -- Chapter 10: Troubleshooting Concurrency Issues -- Technical Requirements -- Reading stack traces -- Detecting failures and healing -- Debugging anomalies -- Summary -- Further reading -- Index -- Other Books You May Enjoy. |
| Record Nr. | UNINA-9911008982603321 |
Serdar Burak
|
||
| Birmingham : , : Packt Publishing, Limited, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Hands-on concurrency with Rust : confidently build memory-safe, parallel, and efficient software in Rust / / Brian L. Troutwine
| Hands-on concurrency with Rust : confidently build memory-safe, parallel, and efficient software in Rust / / Brian L. Troutwine |
| Autore | Troutwine Brian L. |
| Pubbl/distr/stampa | Birmingham, UK : , : Packt Publishing, , 2018 |
| Descrizione fisica | 1 online resource (1 volume) : illustrations |
| Soggetto topico |
Application software - Development
Computer multitasking Programming languages (Electronic computers) |
| Soggetto genere / forma | Electronic books. |
| ISBN | 1-78847-835-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910466618703321 |
|
Troutwine Brian L.
|
||
| Birmingham, UK : , : Packt Publishing, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Hands-on concurrency with Rust : confidently build memory-safe, parallel, and efficient software in Rust / / Brian L. Troutwine
| Hands-on concurrency with Rust : confidently build memory-safe, parallel, and efficient software in Rust / / Brian L. Troutwine |
| Autore | Troutwine Brian L. |
| Pubbl/distr/stampa | Birmingham, UK : , : Packt Publishing, , 2018 |
| Descrizione fisica | 1 online resource (1 volume) : illustrations |
| Soggetto topico |
Application software - Development
Computer multitasking Programming languages (Electronic computers) |
| ISBN | 1-78847-835-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910796825603321 |
|
Troutwine Brian L.
|
||
| Birmingham, UK : , : Packt Publishing, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Task scheduling for parallel systems [[electronic resource] /] / Oliver Sinnen
| Task scheduling for parallel systems [[electronic resource] /] / Oliver Sinnen |
| Autore | Sinnen Oliver <1971-> |
| Pubbl/distr/stampa | Hoboken, N.J., : Wiley-Interscience, c2007 |
| Descrizione fisica | 1 online resource (314 p.) |
| Disciplina |
004.35
004/.35 |
| Collana | Wiley series on parallel and distributed computing |
| Soggetto topico |
Parallel processing (Electronic computers)
Computer multitasking Computer scheduling |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-280-90109-8
9786610901098 0-470-12117-3 0-470-12116-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
TASK SCHEDULING FOR PARALLEL SYSTEMS; CONTENTS; Preface; Acknowledgments; 1. Introduction; 1.1 Overview; 1.2 Organization; 2. Parallel Systems and Programming; 2.1 Parallel Architectures; 2.1.1 Flynn's Taxonomy; 2.1.2 Memory Architectures; 2.1.3 Programming Paradigms and Models; 2.2 Communication Networks; 2.2.1 Static Networks; 2.2.2 Dynamic Networks; 2.3 Parallelization; 2.4 Subtask Decomposition; 2.4.1 Concurrency and Granularity; 2.4.2 Decomposition Techniques; 2.4.3 Computation Type and Program Formulation; 2.4.4 Parallelization Techniques; 2.4.5 Target Parallel System
2.5 Dependence Analysis2.5.1 Data Dependence; 2.5.2 Data Dependence in Loops; 2.5.3 Control Dependence; 2.6 Concluding Remarks; 2.7 Exercises; 3. Graph Representations; 3.1 Basic Graph Concepts; 3.1.1 Computer Representation of Graphs; 3.1.2 Elementary Graph Algorithms; 3.2 Graph as a Program Model; 3.2.1 Computation and Communication Costs; 3.2.2 Comparison Criteria; 3.3 Dependence Graph (DG); 3.3.1 Iteration Dependence Graph; 3.3.2 Summary; 3.4 Flow Graph (FG); 3.4.1 Data-Driven Execution Model; 3.4.2 Summary; 3.5 Task Graph (DAG); 3.5.1 Graph Transformations and Conversions 3.5.2 Motivations and Limitations3.5.3 Summary; 3.6 Concluding Remarks; 3.7 Exercises; 4. Task Scheduling; 4.1 Fundamentals; 4.2 With Communication Costs; 4.2.1 Schedule Example; 4.2.2 Scheduling Complexity; 4.3 Without Communication Costs; 4.3.1 Schedule Example; 4.3.2 Scheduling Complexity; 4.4 Task Graph Properties; 4.4.1 Critical Path; 4.4.2 Node Levels; 4.4.3 Granularity; 4.5 Concluding Remarks; 4.6 Exercises; 5. Fundamental Heuristics; 5.1 List Scheduling; 5.1.1 Start Time Minimization; 5.1.2 With Dynamic Priorities; 5.1.3 Node Priorities; 5.2 Scheduling with Given Processor Allocation 5.2.1 Phase Two5.3 Clustering; 5.3.1 Clustering Algorithms; 5.3.2 Linear Clustering; 5.3.3 Single Edge Clustering; 5.3.4 List Scheduling as Clustering; 5.3.5 Other Algorithms; 5.4 From Clustering to Scheduling; 5.4.1 Assigning Clusters to Processors; 5.4.2 Scheduling on Processors; 5.5 Concluding Remarks; 5.6 Exercises; 6. Advanced Task Scheduling; 6.1 Insertion Technique; 6.1.1 List Scheduling with Node Insertion; 6.2 Node Duplication; 6.2.1 Node Duplication Heuristics; 6.3 Heterogeneous Processors; 6.3.1 Scheduling; 6.4 Complexity Results; 6.4.1 α|β|γ Classification 6.4.2 Without Communication Costs6.4.3 With Communication Costs; 6.4.4 With Node Duplication; 6.4.5 Heterogeneous Processors; 6.5 Genetic Algorithms; 6.5.1 Basics; 6.5.2 Chromosomes; 6.5.3 Reproduction; 6.5.4 Selection, Complexity, and Flexibility; 6.6 Concluding Remarks; 6.7 Exercises; 7. Communication Contention in Scheduling; 7.1 Contention Awareness; 7.1.1 End-Point Contention; 7.1.2 Network Contention; 7.1.3 Integrating End-Point and Network Contention; 7.2 Network Model; 7.2.1 Topology Graph; 7.2.2 Routing; 7.2.3 Scheduling Network Model; 7.3 Edge Scheduling 7.3.1 Scheduling Edge on Route |
| Record Nr. | UNINA-9910143405503321 |
|
Sinnen Oliver <1971->
|
||
| Hoboken, N.J., : Wiley-Interscience, c2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Task scheduling for parallel systems [[electronic resource] /] / Oliver Sinnen
| Task scheduling for parallel systems [[electronic resource] /] / Oliver Sinnen |
| Autore | Sinnen Oliver <1971-> |
| Pubbl/distr/stampa | Hoboken, N.J., : Wiley-Interscience, c2007 |
| Descrizione fisica | 1 online resource (314 p.) |
| Disciplina |
004.35
004/.35 |
| Collana | Wiley series on parallel and distributed computing |
| Soggetto topico |
Parallel processing (Electronic computers)
Computer multitasking Computer scheduling |
| ISBN |
1-280-90109-8
9786610901098 0-470-12117-3 0-470-12116-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
TASK SCHEDULING FOR PARALLEL SYSTEMS; CONTENTS; Preface; Acknowledgments; 1. Introduction; 1.1 Overview; 1.2 Organization; 2. Parallel Systems and Programming; 2.1 Parallel Architectures; 2.1.1 Flynn's Taxonomy; 2.1.2 Memory Architectures; 2.1.3 Programming Paradigms and Models; 2.2 Communication Networks; 2.2.1 Static Networks; 2.2.2 Dynamic Networks; 2.3 Parallelization; 2.4 Subtask Decomposition; 2.4.1 Concurrency and Granularity; 2.4.2 Decomposition Techniques; 2.4.3 Computation Type and Program Formulation; 2.4.4 Parallelization Techniques; 2.4.5 Target Parallel System
2.5 Dependence Analysis2.5.1 Data Dependence; 2.5.2 Data Dependence in Loops; 2.5.3 Control Dependence; 2.6 Concluding Remarks; 2.7 Exercises; 3. Graph Representations; 3.1 Basic Graph Concepts; 3.1.1 Computer Representation of Graphs; 3.1.2 Elementary Graph Algorithms; 3.2 Graph as a Program Model; 3.2.1 Computation and Communication Costs; 3.2.2 Comparison Criteria; 3.3 Dependence Graph (DG); 3.3.1 Iteration Dependence Graph; 3.3.2 Summary; 3.4 Flow Graph (FG); 3.4.1 Data-Driven Execution Model; 3.4.2 Summary; 3.5 Task Graph (DAG); 3.5.1 Graph Transformations and Conversions 3.5.2 Motivations and Limitations3.5.3 Summary; 3.6 Concluding Remarks; 3.7 Exercises; 4. Task Scheduling; 4.1 Fundamentals; 4.2 With Communication Costs; 4.2.1 Schedule Example; 4.2.2 Scheduling Complexity; 4.3 Without Communication Costs; 4.3.1 Schedule Example; 4.3.2 Scheduling Complexity; 4.4 Task Graph Properties; 4.4.1 Critical Path; 4.4.2 Node Levels; 4.4.3 Granularity; 4.5 Concluding Remarks; 4.6 Exercises; 5. Fundamental Heuristics; 5.1 List Scheduling; 5.1.1 Start Time Minimization; 5.1.2 With Dynamic Priorities; 5.1.3 Node Priorities; 5.2 Scheduling with Given Processor Allocation 5.2.1 Phase Two5.3 Clustering; 5.3.1 Clustering Algorithms; 5.3.2 Linear Clustering; 5.3.3 Single Edge Clustering; 5.3.4 List Scheduling as Clustering; 5.3.5 Other Algorithms; 5.4 From Clustering to Scheduling; 5.4.1 Assigning Clusters to Processors; 5.4.2 Scheduling on Processors; 5.5 Concluding Remarks; 5.6 Exercises; 6. Advanced Task Scheduling; 6.1 Insertion Technique; 6.1.1 List Scheduling with Node Insertion; 6.2 Node Duplication; 6.2.1 Node Duplication Heuristics; 6.3 Heterogeneous Processors; 6.3.1 Scheduling; 6.4 Complexity Results; 6.4.1 α|β|γ Classification 6.4.2 Without Communication Costs6.4.3 With Communication Costs; 6.4.4 With Node Duplication; 6.4.5 Heterogeneous Processors; 6.5 Genetic Algorithms; 6.5.1 Basics; 6.5.2 Chromosomes; 6.5.3 Reproduction; 6.5.4 Selection, Complexity, and Flexibility; 6.6 Concluding Remarks; 6.7 Exercises; 7. Communication Contention in Scheduling; 7.1 Contention Awareness; 7.1.1 End-Point Contention; 7.1.2 Network Contention; 7.1.3 Integrating End-Point and Network Contention; 7.2 Network Model; 7.2.1 Topology Graph; 7.2.2 Routing; 7.2.3 Scheduling Network Model; 7.3 Edge Scheduling 7.3.1 Scheduling Edge on Route |
| Record Nr. | UNINA-9910830218803321 |
|
Sinnen Oliver <1971->
|
||
| Hoboken, N.J., : Wiley-Interscience, c2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Task scheduling for parallel systems / / Oliver Sinnen
| Task scheduling for parallel systems / / Oliver Sinnen |
| Autore | Sinnen Oliver <1971-> |
| Pubbl/distr/stampa | Hoboken, N.J., : Wiley-Interscience, c2007 |
| Descrizione fisica | 1 online resource (314 p.) |
| Disciplina | 004/.35 |
| Collana | Wiley series on parallel and distributed computing |
| Soggetto topico |
Parallel processing (Electronic computers)
Computer multitasking Computer scheduling |
| ISBN |
9786610901098
9781280901096 1280901098 9780470121177 0470121173 9780470121160 0470121165 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
TASK SCHEDULING FOR PARALLEL SYSTEMS; CONTENTS; Preface; Acknowledgments; 1. Introduction; 1.1 Overview; 1.2 Organization; 2. Parallel Systems and Programming; 2.1 Parallel Architectures; 2.1.1 Flynn's Taxonomy; 2.1.2 Memory Architectures; 2.1.3 Programming Paradigms and Models; 2.2 Communication Networks; 2.2.1 Static Networks; 2.2.2 Dynamic Networks; 2.3 Parallelization; 2.4 Subtask Decomposition; 2.4.1 Concurrency and Granularity; 2.4.2 Decomposition Techniques; 2.4.3 Computation Type and Program Formulation; 2.4.4 Parallelization Techniques; 2.4.5 Target Parallel System
2.5 Dependence Analysis2.5.1 Data Dependence; 2.5.2 Data Dependence in Loops; 2.5.3 Control Dependence; 2.6 Concluding Remarks; 2.7 Exercises; 3. Graph Representations; 3.1 Basic Graph Concepts; 3.1.1 Computer Representation of Graphs; 3.1.2 Elementary Graph Algorithms; 3.2 Graph as a Program Model; 3.2.1 Computation and Communication Costs; 3.2.2 Comparison Criteria; 3.3 Dependence Graph (DG); 3.3.1 Iteration Dependence Graph; 3.3.2 Summary; 3.4 Flow Graph (FG); 3.4.1 Data-Driven Execution Model; 3.4.2 Summary; 3.5 Task Graph (DAG); 3.5.1 Graph Transformations and Conversions 3.5.2 Motivations and Limitations3.5.3 Summary; 3.6 Concluding Remarks; 3.7 Exercises; 4. Task Scheduling; 4.1 Fundamentals; 4.2 With Communication Costs; 4.2.1 Schedule Example; 4.2.2 Scheduling Complexity; 4.3 Without Communication Costs; 4.3.1 Schedule Example; 4.3.2 Scheduling Complexity; 4.4 Task Graph Properties; 4.4.1 Critical Path; 4.4.2 Node Levels; 4.4.3 Granularity; 4.5 Concluding Remarks; 4.6 Exercises; 5. Fundamental Heuristics; 5.1 List Scheduling; 5.1.1 Start Time Minimization; 5.1.2 With Dynamic Priorities; 5.1.3 Node Priorities; 5.2 Scheduling with Given Processor Allocation 5.2.1 Phase Two5.3 Clustering; 5.3.1 Clustering Algorithms; 5.3.2 Linear Clustering; 5.3.3 Single Edge Clustering; 5.3.4 List Scheduling as Clustering; 5.3.5 Other Algorithms; 5.4 From Clustering to Scheduling; 5.4.1 Assigning Clusters to Processors; 5.4.2 Scheduling on Processors; 5.5 Concluding Remarks; 5.6 Exercises; 6. Advanced Task Scheduling; 6.1 Insertion Technique; 6.1.1 List Scheduling with Node Insertion; 6.2 Node Duplication; 6.2.1 Node Duplication Heuristics; 6.3 Heterogeneous Processors; 6.3.1 Scheduling; 6.4 Complexity Results; 6.4.1 α|β|γ Classification 6.4.2 Without Communication Costs6.4.3 With Communication Costs; 6.4.4 With Node Duplication; 6.4.5 Heterogeneous Processors; 6.5 Genetic Algorithms; 6.5.1 Basics; 6.5.2 Chromosomes; 6.5.3 Reproduction; 6.5.4 Selection, Complexity, and Flexibility; 6.6 Concluding Remarks; 6.7 Exercises; 7. Communication Contention in Scheduling; 7.1 Contention Awareness; 7.1.1 End-Point Contention; 7.1.2 Network Contention; 7.1.3 Integrating End-Point and Network Contention; 7.2 Network Model; 7.2.1 Topology Graph; 7.2.2 Routing; 7.2.3 Scheduling Network Model; 7.3 Edge Scheduling 7.3.1 Scheduling Edge on Route |
| Record Nr. | UNINA-9911019361003321 |
|
Sinnen Oliver <1971->
|
||
| Hoboken, N.J., : Wiley-Interscience, c2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Transactions on petri nets and other models of concurrency . II Special issue on concurrency in process-aware information systems / / Kurt Jensen, Wil M.P. van der Aalst (eds.)
| Transactions on petri nets and other models of concurrency . II Special issue on concurrency in process-aware information systems / / Kurt Jensen, Wil M.P. van der Aalst (eds.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg, : Springer, c2009 |
| Descrizione fisica | 1 online resource (XVIII, 297 p.) |
| Disciplina | 005.11 |
| Altri autori (Persone) |
JensenK <1950-> (Kurt)
AalstWil van der |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Computer multitasking
Information resources management Xarxes de Petri Programació multitasca (Informàtica) Gestió de la informació |
| Soggetto genere / forma | Llibres electrònics |
| ISBN | 3-642-00899-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Process-Aware Information Systems: Lessons to Be Learned from Process Mining -- Model-Based Software Engineering and Process-Aware Information Systems -- Petri Net Transformations for Business Processes – A Survey -- A Look Around the Corner: The Pi-Calculus -- newYAWL: Towards Workflow 2.0 -- A Formal Model for Organisational Structures behind Process-Aware Information Systems -- Flexibility in Process-Aware Information Systems -- Business Grid: Combining Web Services and the Grid -- Does My Service Have Partners? -- Deciding Substitutability of Services with Operating Guidelines -- A Framework for Linking and Pricing No-Cure-No-Pay Services -- Empirical Studies in Process Model Verification -- Process Mining: Overview and Outlook of Petri Net Discovery Algorithms -- Construction of Process Models from Example Runs -- Online Interaction Analysis Framework for Ad-Hoc Collaborative Processes in SOA-Based Environments -- Exploiting Inductive Logic Programming Techniques for Declarative Process Mining. |
| Altri titoli varianti | Special issue on concurrency in process-aware information systems |
| Record Nr. | UNINA-9910484509003321 |
| Berlin ; ; Heidelberg, : Springer, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Transactions on petri nets and other models of concurrency I / / K. Jensen, Wil van der Aalst, Jonathan Billington
| Transactions on petri nets and other models of concurrency I / / K. Jensen, Wil van der Aalst, Jonathan Billington |
| Autore | Jensen K. |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin : , : Springer, , [2008] |
| Descrizione fisica | 1 online resource (XVIII, 251 p.) |
| Disciplina | 511.3 |
| Collana | Transactions on Petri Nets and Other Models of Concurrency |
| Soggetto topico |
Petri nets
Computer multitasking |
| ISBN | 3-540-89287-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Constructive Alignment for Teaching Model-Based Design for Concurrency -- Teaching Modelling and Validation of Concurrent Systems Using Coloured Petri Nets -- Teaching Concurrency Concepts to Freshmen -- TAPAs: A Tool for the Analysis of Process Algebras -- Translating Message Sequence Charts to other Process Languages Using Process Mining -- Net Components for the Integration of Process Mining into Agent-Oriented Software Engineering -- Time Recursive Petri Nets -- Designing Case Handling Systems -- Model Driven Testing Based on Test History -- Assessing State Spaces Using Petri-Net Synthesis and Attribute-Based Visualization -- Directed Unfolding of Petri Nets -- McMillan’s Complete Prefix for Contextual Nets -- Elasticity and Petri Nets. |
| Record Nr. | UNINA-9910484615203321 |
|
Jensen K.
|
||
| Berlin : , : Springer, , [2008] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Transactions on petri nets and other models of concurrency I / / K. Jensen, Wil van der Aalst, Jonathan Billington
| Transactions on petri nets and other models of concurrency I / / K. Jensen, Wil van der Aalst, Jonathan Billington |
| Autore | Jensen K. |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin : , : Springer, , [2008] |
| Descrizione fisica | 1 online resource (XVIII, 251 p.) |
| Disciplina | 511.3 |
| Collana | Transactions on Petri Nets and Other Models of Concurrency |
| Soggetto topico |
Petri nets
Computer multitasking |
| ISBN | 3-540-89287-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Constructive Alignment for Teaching Model-Based Design for Concurrency -- Teaching Modelling and Validation of Concurrent Systems Using Coloured Petri Nets -- Teaching Concurrency Concepts to Freshmen -- TAPAs: A Tool for the Analysis of Process Algebras -- Translating Message Sequence Charts to other Process Languages Using Process Mining -- Net Components for the Integration of Process Mining into Agent-Oriented Software Engineering -- Time Recursive Petri Nets -- Designing Case Handling Systems -- Model Driven Testing Based on Test History -- Assessing State Spaces Using Petri-Net Synthesis and Attribute-Based Visualization -- Directed Unfolding of Petri Nets -- McMillan’s Complete Prefix for Contextual Nets -- Elasticity and Petri Nets. |
| Record Nr. | UNISA-996465882603316 |
|
Jensen K.
|
||
| Berlin : , : Springer, , [2008] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
