CONCUR 2001 － 并发理论 CONCUR 2001
点此进入淘宝搜索页搜索分类: 图书,计算机/网络,计算机理论,
作者： Kim G. Larsen著
出 版 社： 湖南文艺出版社
出版时间： 2001-12-1字数：版次： 1页数： 581印刷时间： 2006/12/01开本：印次：纸张： 胶版纸I S B N ： 9783540424970包装： 平装编辑推荐
The LNCS series reports state-of-the-art results in computer science research,development,and education,at a high level and in both printed and electronic form.Enjoying tight cooperation with the R&D community,with numerous individuals,as well as with prestigious organizations and societies,LNCS has grown into the most comprehensive computer science resarch forum available.
The scope of LNCS,including its subseries LNAI,spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields.The type of material publised traditionally includes.
-proceedings(published in time for the respective conference)
-post-proceedings(consisting of thoroughly revised final full papers)
-research monographs(which may be basde on outstanding PhD work,research projects,technical reports,etc.)
内容简介
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 carefully reviewed and selected from 78 submissions. The papers are organized in topical sections on mobility, probabilistic systems, model checking, process algebra, unfoldings and prefixes, logic and compositionality, and games.
目录
Invited Talks
Channel Representations in Protocol Verification (Preliminary Version)
Bigraphical Reactive Systems
Control of Networks of Unmanned Vehicles
Process Algebra and Security
Invited Tutorials
Using the Bandera Tool Set to Model-Check Properties of Concurrent Java Software
Performance Evaluation:=(Process Algebra + Model Checking)×Markov Chains
Mobility
Typing Mobility in the Seal Calculus
Reasoning about Security in Mobile Ambients
Synchronized Hyperedge Replacement with Name Mobility(A Graphical Calculus for Mobile Systems)
Dynamic Input/Output Automata: A Formal Model for Dynamic Systems
Probabilistic Systems
Probabilistic Information Flow in a Process Algebra
Symbolic Computation of Maximal Probabilistic Reachability
Randomized Non-sequential Processes (Preliminary Version)
Model Checking
Liveness and Fairness in Process-Algebraic Verification
Bounded Reachability Checking with Process Semantics
Techniques for Smaller Intermediary BDDs
An Algebraic Characterization of Data and Timed Languages
Process Algebra
A Faster-than Relation for Asynchronous Processes
On the Power of Labels in Transition Systems
On Barbed Equivalences in 7~-Calculus
CCS with Priority Guards
Probabilistic Systems
A Testing Theory for Generally Distributed Stochastic Processes
An Algorithm for Quantitative Verification of Probabilistic Transition Systems
Compositional Methods for Probabilistic Systems
Unfoldings and Prefixes
Towards an Efficient Algorithm for Unfolding Petri Nets
A Static Analysis Technique for Graph Transformation Systems
Local First Search--A New Paradigm for Partial Order Reductions
Extending Memory Consistency of Finite Prefixes to Infinite Computations
Model Checking
Logic and Compositionality
Games
Author Index
