did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

We're the #1 textbook rental company. Let us show you why.

9783540440437

CONCUR 2002 - Concurrency Theory : 13th International Conference, Brno, Czech Republic, August 20-23, 2002. Proceedings

by ; ;
  • ISBN13:

    9783540440437

  • ISBN10:

    3540440437

  • Format: Paperback
  • Copyright: 2002-11-01
  • Publisher: Springer Verlag
  • Purchase Benefits
List Price: $159.00

Summary

This book constitutes the refereed proceedings of the 13th International Conference on Concurrency Theory, CONCUR 2002, held in Brno, Czech Republic in August 2002. The 32 revised full papers presented together with abstracts of seven invited contributions were carefully reviewed and selected from 101 submissions. The papers are organized in topical sections on verification and model checking, logic, mobility, probabilistic systems, models of computation and process algebra, security, Petri nets, and bisimulation.

Table of Contents

Invited Talks
Refinement and Verification Applied to an In-Flight Data Acquisition Unit
1(23)
Wan Fokkink
Natalia Ioustinova
Ernst Kesseler
Jaco van de Pol
Yaroslav S. Usenko
Yuri A. Yushtein
A Deductive Proof System for CTL
24(17)
Amir Pnueli
Yonit Kesten
Event-State Duality: The Enriched Case
41(16)
Vaughan R. Pratt
Expressive Power of Temporal Logics
57(19)
Alexander Rabinovich
Types, or: Where's the Difference Between CCS and π?
76(22)
Davide Sangiorgi
Invited Tutorials
Introduction to Modal and Temporal Mu-Calculi (Abstract)
98(1)
Julian C. Bradfield
Types for Cryptographic Protocols
99(2)
Andrew D. Gordon
Verification, Model Checking
Network Invariants in Action
101(15)
Yonit Kesten
Amir Pnueli
Elad Shahar
Lenore Zuck
Regular Model Checking Made Simple and Efficient
116(15)
Parosh Aziz Abdulla
Bengt Jonsson
Marcus Nilsson
Julien d'Orso
A Hierarchy of Polynomial-Time Computable Simulations for Automata
131(14)
Kousha Etessami
A Decidable Class of Asynchronous Distributed Controllers
145(16)
P. Madhusudan
P. S. Thiagarajan
Alphabet-Based Synchronisation is Exponentially Cheaper
161(16)
Antti Valmari
Antti Kervinen
Safe Realizability of High-Level Message Sequence Charts
177(16)
Markus Lohrey
Widening the Boundary between Decidable and Undecidable Hybrid Systems
193(16)
Eugene Asarin
Gerardo Schneider
Logic
A Spatial Logic for Concurrency (Part II)
209(17)
Luis Caires
Luca Cardelli
Reducing Model Checking from Multi-valued CTL* to CTL*
226(14)
Beata Konikowska
Wojciech Penczek
Local Model Checking Games for Fixed Point Logic with Chop
240(15)
Martin Lange
A Decidable Fixpoint Logic for Time-Outs
255(17)
Maria Sorea
Mobility
A Calculus of Mobile Resources
272(16)
Jens Chr. Godskesen
Thomas Hildebrandt
Vladimiro Sassone
Using Ambients to Control Resources
288(16)
David Teller
Pascal Zimmer
Daniel Hirschkoff
Typing and Subtyping Mobility in Boxed Ambients
304(17)
Massimo Merro
Vladimiro Sassone
Orchestrating Transactions in Join Calculus
321(17)
Roberto Bruni
Cosimo Laneve
Ugo Montanari
Probabilistic Systems
Simulation for Continuous-Time Markov Chains
338(17)
Christel Baier
Joost-Pieter Katoen
Holger Hermanns
Boudewijn Haverkort
Weak Bisimulation is Sound and Gomplete for PCTL*
355(16)
Josee Desharnais
Vineet Gupta
Radha Jagadeesan*
Prakash Panangaden*
Decision Algorithms for Probabilistic Bisimulation
371(15)
Stefano Cattani
Roberto Segala
Models of Computation, Process Algebra
Axiomatizing an Algebra of Step Reactions for Synchronous Languages
386(16)
Gerald Luttgen
Michael Mendler
Regular Sets of Pomsets with Autoconcurrency
402(16)
Jean Fanchon
Remi Morin
The Fusion Machine (Extended Abstract)
418(16)
Philippa Gardner
Cosimo Laneve
Lucian Wischik
HOPLA---A Higher-Order Process Language
434(15)
Mikkel Nygaard
Glynn Winskel
A First Order Coalgebraic Model of π-Calculus Early Observational Equivalence
449(17)
Maria Grazia Buscemi
Ugo Montanari
Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes
466(17)
Stephen Brookes
Security
A Framework for the Analysis of Security Protocols
483(16)
Michele Boreale
Maria Grazia Buscemi
On Name Generation and Set-Based Analysis in the Dolev-Yao Model
499(16)
Roberto M. Amadio
Witold Charatonik
On the Decidability of Cryptographic Protocols with Open-Ended Data Structures
515(16)
Ralf Kusters
Petri Nets
Causality Semantics of Petri Nets with Weighted Inhibitor Arcs
531(16)
H. C. M. Kleijn
M. Koutny
Refinement-Robust Fairness
547(15)
Hagen Volzer
Bisimulation
Decidability of Strong Bisimilarity for Timed BPP
562(17)
Stawomir Lasota
Undecidability of Weak Bisimilarity for Pushdown Processes
579(15)
Jiri Srba
Why Is Simulation Harder than Bisimulation?
594(17)
Antonin Kucera
Richard Mayr
Author Index 611

Supplemental Materials

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Rewards Program