Sold Out
Book Categories |
Channel Representations in Protocol Verification | 1 | |
Bigraphical Reactive Systems | 16 | |
Control of Networks of Unmanned Vehicles | 36 | |
Process Algebra and Security | 37 | |
Using the Bandera Tool Set to Model-Check Properties of Concurrent Java Software | 39 | |
Performance Evaluation := (Process Algebra + Model Checking) x Markov Chains | 59 | |
Typing Mobility in the Seal Calculus | 82 | |
Reasoning about Security in Mobile Ambients | 102 | |
Synchronized Hyperedge Replacement with Name Mobility (A Graphical Calculus for Mobile Systems) | 121 | |
Dynamic Input/Output Automata: A Formal Model for Dynamic Systems | 137 | |
Probabilistic Information Flow in a Process Algebra | 152 | |
Symbolic Computation of Maximal Probabilistic Reachability | 169 | |
Randomized Non-sequential Processes | 184 | |
Liveness and Fairness in Process-Algebraic Verification | 202 | |
Bounded Reachability Checking with Process Semantics | 218 | |
Techniques for Smaller Intermediary BDDs | 233 | |
An Algebraic Characterization of Data and Timed Languages | 248 | |
A Faster-than Relation for Asynchronous Processes | 262 | |
On the Power of Labels in Transition Systems | 277 | |
On Barbed Equivalences in [pi]-Calculus | 292 | |
CCS with Priority Guards | 305 | |
A Testing Theory for Generally Distributed Stochastic Processes | 321 | |
An Algorithm for Quantitative Verification of Probabilistic Transition Systems | 336 | |
Compositional Methods for Probabilistic Systems | 351 | |
Towards an Efficient Algorithm for Unfolding Petri Nets | 366 | |
A Static Analysis Technique for Graph Transformation Systems | 381 | |
Local First Search - A New Paradigm for Partial Order Reductions | 396 | |
Extending Memory Consistency of Finite Prefixes to Infinite Computations | 411 | |
Abstraction-Based Model Checking Using Modal Transition Systems | 426 | |
Efficient Multiple-Valued Model-Checking Using Lattice Representations | 441 | |
Divide and Compose: SCC Refinement for Language Emptiness | 456 | |
Unavoidable Configurations of Parameterized Rings of Processes | 472 | |
Logic of Global Synchrony | 487 | |
Compositional Modeling of Reactive Systems Using Open Nets | 502 | |
Extended Temporal Logic Revisited | 519 | |
Symbolic Algorithms for Infinite-State Games | 536 | |
A Game-Based Verification of Non-repudiation and Fair Exchange Protocols | 551 | |
The Control of Synchronous Systems, Part II | 566 | |
Author Index | 583 |
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish ListX
This item is in your CollectionConcur 2001 - Concurrency Theory : 12th Interntaional Conference, Aalborg, Denmark, August 20-25, 2001 Proceedings
X
This Item is in Your InventoryConcur 2001 - Concurrency Theory : 12th Interntaional Conference, Aalborg, Denmark, August 20-25, 2001 Proceedings
X
You must be logged in to review the productsX
X
X
Add Concur 2001 - Concurrency Theory : 12th Interntaional Conference, Aalborg, Denmark, August 20-25, 2001 Proceedings, This book constitutes the refereed proceedings of the 12th International Conference on Concurrency Theory, CONCUR 2001, held in Aalborg, Denmark in August 2001. The 32 revised full papers presented together with six invited contributions were carefull, Concur 2001 - Concurrency Theory : 12th Interntaional Conference, Aalborg, Denmark, August 20-25, 2001 Proceedings to the inventory that you are selling on WonderClubX
X
Add Concur 2001 - Concurrency Theory : 12th Interntaional Conference, Aalborg, Denmark, August 20-25, 2001 Proceedings, This book constitutes the refereed proceedings of the 12th International Conference on Concurrency Theory, CONCUR 2001, held in Aalborg, Denmark in August 2001. The 32 revised full papers presented together with six invited contributions were carefull, Concur 2001 - Concurrency Theory : 12th Interntaional Conference, Aalborg, Denmark, August 20-25, 2001 Proceedings to your collection on WonderClub |