Electronic Notes in Theoretical Computer Science, Volume 162

Volume 162, September 2006

• Luca Aceto, Andrew D. Gordon:
  Preface. 1-2
  
• Samson Abramsky:
  What are the Fundamental Structures of Concurrency?: We still don't know! 37-41
  
• Luca Aceto, Wan Fokkink:
  The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems. 43-48
  
• Roberto M. Amadio, Gérard Boudol, Frédéric Boussinot, Ilaria Castellani:
  Reactive Concurrent Programming Revisited. 49-60
  
• Jos C. M. Baeten, Jan A. Bergstra:
  Six Themes for Future Concurrency Research. 61-64
  
• Jos C. M. Baeten, Mario Bravetti:
  A Generic Process Algebra. 65-71
  
• Christel Baier, Holger Hermanns, Joost-Pieter Katoen, Verena Wolf:
  Bisimulation and Simulation Relations for Markov Chains. 73-78
  
• Jan A. Bergstra:
  On the Design Rationale of ACP Style Process Algebras. 79-85
  
• Marco Bernardo:
  Markovian Testing and Trace Equivalences Exactly Lump More Than Markovian Bisimilarity. 87-99
  
• Tommaso Bolognesi:
  Process Algebra Under the Light of Wolfram's NKS. 101-105
  
• Mario Bravetti, Holger Hermanns, Joost-Pieter Katoen:
  YMCA: - Why Markov Chain Algebra? - . 107-112
  
• Mario Bravetti:
  Stochastic and Real Time in Process Algebra: A Conceptual Overview. 113-119
  
• Mario Bravetti, Gianluigi Zavattaro:
  Service Oriented Computing: A New Challenge for Process Algebras. 121-125
  
• Stephen Brookes:
  Retracing CSP. 127-133
  
• Maria Grazia Buscemi, Ugo Montanari:
  A Compositional Coalgebraic Model of a Fragment of Fusion Calculus. 135-139
  
• Nadia Busi, Gianluigi Zavattaro:
  A Process Algebraic View of Coordination. 141-145
  
• Samuele Carpineti, Cosimo Laneve:
  A Rude Contract Language for Web Services. 147-152
  
• Pieter J. L. Cuijpers, Michel A. Reniers:
  Topological Aspects of Hybrid Processes: A Proposed Treatment Using Non-standard Analysis. 153-158
  
• Rocco De Nicola:
  From Process Calculi to Klaim and Back. 159-162
  
• Zoltán Ésik:
  Cascade Products and Temporal Logics on Finite Trees. 163-166
  
• Rachele Fuzzati, Uwe Nestmann:
  Much Ado About Nothing? 167-171
  
• Rob J. van Glabbeek:
  On Specifying Timeouts. 173-175
  
• Andrew D. Gordon:
  V for Virtual. 177-181
  
• Clemens Grabmayer, Jan Willem Klop, Bas Luttik:
  Reflections on a Geometry of Processes. 183-190
  
• Jan Friso Groote, Aad Mathijssen, Muck van Weerdenburg, Yaroslav S. Usenko:
  From µCRL to mCRL2: Motivation and Outline. 191-196
  
• Jan Friso Groote, Michel A. Reniers, Yaroslav S. Usenko:
  Discretization of Timed Automata in Timed mu. 197-202
  
• Radu Grosu, Scott A. Smolka:
  Monte Carlo Methods for Process Algebra. 203-207
  
• Tony Hoare:
  Why ever CSP? 209-215
  
• Kohei Honda:
  Process Algebras in the Age of Ubiquitous Computing. 217-220
  
• Insup Lee, Anna Philippou, Oleg Sokolsky:
  A Family of Resource-Bound Real-Time Process Algebras. 221-226
  
• Bas Luttik:
  What is algebraic in process theory? 227-231
  
• Sergio Maffeis:
  Process Calculi and Peer-to-peer Web Data Integration. 233-236
  
• C. A. Middelburg:
  Conditionals in Algebraic Process Calculi. 237-241
  
• Dale Miller:
  A Proof Theoretic Approach to Operational Semantics. 243-247
  
• George J. Milne:
  Modelling Dynamically Changing Hardware Structure. 249-254
  
• Robin Milner:
  Pervasive Process Calculus. 255-259
  
• Michael W. Mislove:
  On Combining Probability and Nondeterminism. 261-265
  
• Mohammad Reza Mousavi:
  Towards SOS Meta-Theory for Language-Based Security. 267-271
  
• Joël Ouaknine, Steve Schneider:
  Timed CSP: A Retrospective. 273-276
  
• Catuscia Palamidessi:
  Anonymity in Probabilistic and Nondeterministic Systems. 277-279
  
• Iain C. C. Phillips, Irek Ulidowski:
  Operational Semantics of Reversibility in Process Algebra. 281-286
  
• Alban Ponse, Mark van der Zwaag:
  A Generalization of ACP Using Belnap's Logic. 287-293
  
• K. V. S. Prasad:
  A Prospectus for Mobile Broadcasting Systems. 295-300
  
• Corrado Priami:
  Process Calculi and Life Science. 301-304
  
• A. W. Roscoe:
  Confluence Thanks to Extensional Determinism. 305-309
  
• Davide Sangiorgi:
  Bisimulation and Co-induction: Some Problems. 311-315
  
• Peter Sewell:
  Process Calculi: The End of the Beginning?: (From Thought Experiments to Experimental Semantics). 317-321
  
• Chris M. N. Tofts:
  Process Algebra as Modelling. 323-326
  
• Kazunori Ueda:
  Constraint-Based Concurrency and Beyond. 327-331
  
• Nobuko Yoshida:
  Type-Based Security for Mobile Computing Integrity, Secrecy and Liveness. 333-340