 |
Opamp Technical Books 1033 N. Sycamore Ave. Los Angeles, CA 90038 WWW.OPAMP.COM 1 - 800 - 468 - 4322 8:00am-4:30pm M-F 9:00am-5:30pm Sat |
|
|---|
 |
 |
 |
 |
 |
 |
 |
Keywords: PETRI NET
Your search found 11 books Now viewing Books 1 - 11 In stock items ship IMMEDIATELY. Other titles usually ship within 2-3 days. |
 |
|---|
| Applications and Theory of Petri Nets | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
This book constitutes the refereed proceedings of the 29th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, PETRI NETS 2008, held in Xi'an, China, in June 2008. The 23 revised full regular papers, | |||||||
| SPRINGER VERLAG | S | ISBN-10: 3540687450 ISBN-13: 9783540687450 | PGS: N/A | List: 79.95 YOUR PRICE: 75.95 | |||
| Dynamic Analysis of Petri Net-Based Discrete Systems | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
| , Introduction.- Main Notions, Problems and Methods.- Reduced Reachability Graphs.- Decomposition for Analysis.- Analysis by Solving Logical Equations - Calculation of Siphons and Traps.- Verification of Detailed System Descriptions.- Conclusion. | |||||||
| SPRINGER VERLAG | S | ISBN-10: 3540714644 ISBN-13: 9783540714644 | PGS: N/A | List: 109.00 YOUR PRICE: 103.55 | |||
| Free Choice Petri Nets | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
| Petri nets are a popular and powerful formal model for the analysis and modelling of concurrent systems, and a rich theory has developed around them. Petri nets are taught to undergraduates, and also used by industrial practitioners. This book focuses on a particular class of petri nets, free choice petri nets, which play a central role in the theory. The text is very clearly organised, with every notion carefully explained and every result proved. Clear exposition is given for place invariants, siphons, traps and many other important analysis techniques. The material is organised along the lines of a course book, and each chapter contains numerous exercises, making this book ideal for graduate students and research workers alike. | |||||||
| CAMBRIDGE UNIV. PRESS | ISBN-10: 0521019451 ISBN-13: 9780521019453 | PGS: N/A | List: 37.99 YOUR PRICE: 37.99 | ||||
| Performance Analysis of Communication Systems : Modeling with Non-Markovian Stochastic Petri Nets | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
| Foreword Preface Contents Outline Acknowledgments I Modeling with Stochastic Petri Nets 1 Introduction 1.1 Stochastic Petri Nets 1.2 Technical Approach 1.3 Application to Communication Systems 1.4 Related Work 1.5 Organization of the Text 2 Stochastic Petri Nets 2.1 Definition of Petri Nets 2.2 An Example: OCDR Connection Management 2.3 Petri Net Extensions 2.4 Definition of Stochastic Petri Nets 2.5 The Example Continued 2.6 Bibliographical Notes 3 Tool Support 3.1 A Brief Review of Tools 3.2 TimeNet 3.3 SPNica: A Prototype Tool II Analytical Methodology 4 Preliminaries 4.1 Firing Time Distributions 4.1.1 A Characterization of Distributions 4.1.2 Expolynomial Distributions 4.2 Stochastic Processes 4.3 Quantitative Measures 4.3.1 Firing Frequencies of Transitions 4.3.2 Reward-Based Measure Definitions 4.4 Bibliographical Notes 5 Markovian Stochastic Petri Nets 5.1 Discrete Time 5.1.1 Geometric Firing Time Distributions 5.1.2 Discrete-Time Markov Chains 5.1.3 Example: The Geo/Geo/1/K System 5.2 Continuous Time 5.2.1 Exponential Firing Time Distributions 5.2.2 Continuous-Time Markov Chains 5.2.3 Example: The M/M/1/K System 5.2.4 Uniformization 5.3 Relationship of Continuous and Discrete Time 5.3.1 First Moment Matching 5.3.2 Equidistant Embedding 5.3.3 Uniformized Markov Chain 5.3.4 Embedded Markov Chain 5.4 Bibliographical Notes 6 The Method of Supplementary Variables 6.1 Analysis of the M/G/1 System 6.1.1 Definitions and Notation 6.1.2 Derivation of State Equations 6.1.3 Transform Domain Analysis 6.2 Analysis of the M/G/1/K System 6.2.1 Additional Definitions and Notation 6.2.2 Derivation of State Equations 6.2.3 Time-Domain Analysis 6.2.4 Example: Deterministic Service 6.2.5 Introduction of Vector and Matrix Notation 6.2.6 Example: The M/D/1/K System in Matrix Notation 6.3 Alternative Use of Supplementary Variables 6.4 Bibliographical Notes 7 General State Equations 7.1 Definitions and Notation 7.1.1 Example: OCDR Connection Management 7.1.2 Example: The M/D/1/K System with Preemptions 7.2 Derivation of the State Equations 7.2.1 Example: OCDR Connection Management 7.2.2 Simplifications for Deterministic Timing 7.3 Bibliographical Notes 8 Stationary Analysis 8.1 General Solution Algorithm 8.1.1 Description of the Solution Algorithm 8.1.2 Derivation of the Solution Formulas 8.1.3 Example: OCDR Connection Management 8.1.4 Example: The M/D/1/K System with Preemptions 8.2 Computation of the Integrals 8.2.1 Problem Definition 8.2.2 Uniformization for the Cumulative Transient Analysis 8.2.3 Uniformization for Random Times 8.2.4 Alpha-Factors for Expolynomial Distributions 8.2.5 Alpha-Factors for the Pareto Distribution 8.2.6 Example: Alpha-Factors for the OCDR Model 8.3 Bibliographical Notes 9 Transient Analysis 9.1 Solution of the Partial Differential Equations 9.2 Solution of the Remaining State Equations 9.2.1 Discretization of the Equations 9.2.2 General Solution Algorithm 9.2.3 Simplifications in the Deterministic Case 9.2.4 Complexity Analysis 9.3 Refinement of the Solution Algorithm 9.3.1 Dealing with Discontinuities Explicitly 9.3.2 Separation of Discrete and Continuous Parts 9.3.3 Formulation of a Refined Algorithm 9.4 Periodic DSPNs 9.4.1 Simplified State Equations 9.4.2 Simplified Transient Analysis 9.4.3 Complexity Analysis 9.5 Experimental Evaluation 9.5.1 Case 1: A GSPN 9.5.2 Case 2: A Periodic DSPN 9.5.3 Case 3: A Non-periodic DSPN 9.5.4 The Refined Algorithm 9.6 Bibliographical Notes 10 General Execution Policies 10.1 Definitions and Notation 10.2 Preemption Policies 10.2.1 Derivation of State Equations 10.2.2 Stationary Analysis 10.2.3 The M/G/1/K System with Failures and Repairs 10.3 Enabling-Dependent Firing Time Distributions 10.3.1 Derivation of State Equations 10.3.2 Stationary Analysis 10.3.3 An M/G/1/K System with Degradable Service 10.4 Scaling Factors 10.4.1 Defining the Type of Marking Dependence 10.4.2 Derivation of State Equations 10.4.3 Stationary Analysis 10.4.4 An M/G/1/K System with Degradable Service 10.5 PRS Policy and Marking Dependence 10.5.1 PRS Policy and Enabling Dependence 10.5.2 PRS Policy and Scaling Factors 10.6 Unified Algorithm 10.7 Bibliographical Notes 11 Reducible Structures 11.1 Reducible Markov Chains 11.1.1 Analysis 11.1.2 An Example 11.2 Reducible Non-Markovian Processes 11.2.1 Analysis 11.2.2 An Example 11.3 Bibliographical Notes 12 Markov Renewal Theory 12.1 Main Concepts of Markov Renewal Theory 12.1.1 Regeneration and Embedding 12.1.2 Transient State Equations 12.1.3 Stationary State Equations 12.2 Derivation of the Kernel Matrices 12.2.1 The Markovian Case 12.2.2 The Non-Markovian Case 12.3 Examples 12.3.1 The M/G/1/K System 12.3.2 The OCDR System 12.3.3 The M/D/1/K System with Service Preemptions 12.4 Relationship to Supplementary Variables 12.4.1 Formal Relationship in the Transient Case 12.4.2 Experimental Comparison 12.4.3 Formal Relationship in the Stationary Case 12.4.4 Consequences of the Relationship 12.5 Solution of Large Models 12.5.1 Iterative S | |||||||
| JOHN WILEY & SONS | H | ISBN-10: 0471492582 ISBN-13: 9780471492580 | PGS: 456 | List: 230.00 YOUR PRICE: 218.50 | |||
| Petri Nets and Other Models of Concurrency - ICATPN 2007 | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
This book constitutes the refereed proceedings of the 28th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2007, held in Siedlce, Poland, in June 2007. The 22 revised full papers and 3 re, | |||||||
| SPRINGER VERLAG | S | ISBN-10: 3540730934 ISBN-13: 9783540730934 | PGS: N/A | List: 89.95 YOUR PRICE: 85.45 | |||
| Petri Nets: Fundamental Models, Verification and Applications | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
| A Petri net is a mathematical representation of a network. This book first introduces the basic models including time and stochastic extensions, in particular place-transition and high level Petri nets. Their modeling and design capabilities are illustrated by a set of representations of interest in operating and communication systems. The volume then addresses the related verification problems and proposes corresponding solutions by introducing the main notions needed to fully understand the behavior and properties behind Petri nets. Particular attention is devoted to how systems can be fully represented and analyzed in terms of their behavioral, time, and stochastic aspects by using the same formal approach and semantic basis. Finally, illustrative examples are presented in the important fields of interoperability in telecommunication services, programming languages, multimedia architectures, manufacturing systems, and communication protocols. | |||||||
| Wiley-ISTE | H | ISBN-10: 1848210795 ISBN-13: 9781848210790 | PGS: 0 | List: 295.00 YOUR PRICE: 280.25 | |||
| Stochastic Petri Nets | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
| This book is about stochastic Petri nets (SPNs), which have proven to be a popular tool for modelling and performance analysis of complex discrete-event stochastic systems. The focus is on methods for modelling a system as an SPN with general firing times, Introduction * Modelling with Stochastic Petri Nets * The Marking Process * Modelling Power * Recurrence * Regenerative Simulation * Alternative Simulation Methods * Delays * Colored Stochastic Petri Nets * Appendix A Selected Background * Index | |||||||
| SPRINGER VERLAG | H | ISBN-10: 0387954455 ISBN-13: 9780387954455 | PGS: N/A | List: 109.00 YOUR PRICE: 103.55 | |||
| Supervision of Petri Nets | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
| Supervision of Petri Nets presents supervisory control theory for Petri nets with a legal set as the control goal. Petri nets model discrete event systems - dynamic systems whose evolution is completely determined by the occurrence of discrete ev, | |||||||
| SPRINGER VERLAG | H | ISBN-10: 0792374862 ISBN-13: 9780792374862 | PGS: N/A | List: 229.00 YOUR PRICE: 217.55 | |||
| System Modeling and Control with Resource-Oriented Petri Nets, 1st Ed. | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
| CRC - TAYLOR & FRANCIS | H | ISBN-10: 1439808848 ISBN-13: 9781439808849 | PGS: 312 | List: 113.95 YOUR PRICE: 108.25 | |||
| Think Microsoft.NET | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
| Que - PEARSON | ISBN-10: 0789725959 ISBN-13: 9780789725950 | PGS: N/A | List: 29.99 YOUR PRICE: 28.49 | ||||
| Verification of Systems and Circuits Using LOTOS, Petri Nets, and CCS | |||||||
|---|---|---|---|---|---|---|---|
| |||||||
| CONTENTS: 1. Introduction.@p1.1 Event-Based Approach.@p1.2 Event-Based Systems.@p1.3 Types of Verification.@p1.4 Toolsets Used.@p1.5 Level-Based Approach.@p1.6 Overview of the Book.@p1.7 References.@p2. Processes.@p2.1 Introduction.@p2.2 Examples of Processes and Basic Concepts.@p2.3 About Prefixing.@p2.4 Process Graphs.@p2.5 Choice Operator.@p2.6 Another Process Example.@p2.7 Equivalence.@p2.8 Labeled Transition System (LTSs).@p2.9 Parallel Operators.@p2.10 Sequential Composition.@p2.11 Further Reading.@p2.12 Selected Solutions.@p2.13 References.@p3. From Digital hardware to Processes.@p3.1 The C-Element.@p3.2 The XOR-Gate.@p3.3 TOGGLES.@p3.4 Modulo-N Transaction counters.@p3.5 Modular Networks.@p3.6 Propositional Logic: A Review of Known Concepts.@p3.7 Selected Solutions.@p3.8 References.@p4. Introducing LOTOS.@p4.1 From Blot to Basic LOTOS.@p4.2 Some semantics.@p4.3 From LTS to LOTOS.@p4.4 Comparing Parallel Operators.@p4.5 Sequential Composition.@p4.6 Hiding.@p4.7 Equivalences and Preorders.@p4.8 About CADP.@p4.9 Full LOTOS—An Introduction.@p4.10 The Regular Mu-calculus (RMC).@p4.11 Further Reading.@p4.12 Selected Solutions.@p4.13 References.@p5. Introducing Petri Nets.@p5.1 About Petri Nets.@p5.2 About Languages.@p5.3 About PETRIFY.@p5.4 Illustrating Petri Nets.@p5.5 Labeled Nets.@p5.6 Bounded Nets.@p5.7 Observation Equivalence of LPNs.@p5.8 From Blot to Petri Nets.@p5.9 Liveness and Persistence.@p5.10 Simple Reduction Rules.@p5.11 Marked Graphs.@p5.12 A Simple Net Algebra.@p5.13 Arc-Weighted Nets.@p5.14 Readers—Writers System.@p5.15 Inhibitor Nets.@p5.16 True Concurrency.@p5.17 Further Reading.@p5.18 Selected Solutions.@p5.19 References.@p6. Introducing CCS.@p6.1 About CCS.@p6.2 Operators ‘Prefix’ and ‘Sum’.@p6.3 Recursion.@p6.4 Concurrency.@p6.5 Equivalence.@p6.6 Restriction.@p6.7 CTL.@p6.8 The Concurrency Workbench (CWB).@p6.9 CCS and CWB Application Examples.@p6.10 Further Reading.@p6.11 Selected Solutions.@p6.12 References.@p7. Verification of Modular Asynchronous Circuits.@p7.1 About Asynchronous Circuits.@p7.2 XOR-Gates.@p7.3 CEL-Circuit.@p7.4 Other Modules.@p7.5 Module Extensions.@p7.6 Modular Networks.@p7.7 Realizations.@p7.8 Verification of Extended Modules.@p7.9 Verification of Parallel Control Structures.@p7.10 Further Reading.@p7.11 Selected Solutions.@p7.12 References.@p8. Verification of Communication Protocols.@p8.1 Introduction.@p8.2 Two Simple Communication Protocols.@p8.3 The Alternating Bit (AB) Protocol.@p8.4 Further Reading.@p8.5 Selected Solutions.@p8.6 References.@p9. Verification of Arbiters.@p9.1 Introduction.@p9.2 A random Arbiter (RGDA).@p9.3 A Token-Ring Arbiter.@p9.4 Further reading.@p9.5 Selected Solutions.@p9.6 References.@p10. More Verification Case Studies.@p10.1 Verification of Combinational Logic.@p10.2 Verification of Asynchronous Pipeline Controllers.@p10.3 Verification of Producer – Consumer Systems.@p10.4 Verification Based on Design Approaches.@p10.5 Verification of Toggles and Transition Counters.@p10.6 Vending machines Verification—Revisited.@p10.7 Pi-Realizations.@p10.8 A Comparison of Equivalence Relations.@p10.9 Selected Solutions.@p10.10 References.@p11. Guide to Further Studies.@p11.1 Verification of Telecommunication Systems.@p11.2 Verification Using Colored Petri Nets.@p11.3 Verification of Traffic Signal Control Systems.@p11.4 References.@pIndex. | |||||||
| Wiley-Interscience | H | ISBN-10: 0471704490 ISBN-13: 9780471704492 | PGS: 231 | List: 111.00 YOUR PRICE: 105.45 | |||
|
|
Your search found 11 books Now viewing Books 1 - 11 In stock items ship IMMEDIATELY. Other titles usually ship within 2-3 days. |
|
|---|
Browse Subject ISBN Search Table of Contents Search
Title and/or Author Search Publisher Search Advanced Search
|
|
|
| Location/Hours/General Info. | Ordering & Shipping | Search Techniques/Examples |
| Corporate Accounts | Government Buyers | Librarians |
| Universities & Colleges | Training Accounts | International Orders |
| Technical Books on these areas & more: | ||
|---|---|---|
| Computer | Business | Electronics |
| Engineering | Uniform & Code | Construction |
| Film & TV Industry | Legal | Medical |
| Recording Industry | Math & Science | Classic & Out-Of-Print Titles |
Opamp Technical has one of the largest selections of technical books in the country. Our bookstore was started over 20 years ago. We supply all types of professional & educational technical books to individuals, government agencies, schools, corporate libraries, & many industries.
|
|
|
|
|
|
OPAMP Technical Books
1033 N. Sycamore Avenue
Los Angeles, California 90038
USA
800-468-4322 / 323-464-4322 FAX
323-464-0977
Copyright © 1997-2007 Opamp Technical Books, Inc.