This volume contains the proceedings of the 19th International Conference on Concurrency Theory (CONCUR 2008) which took place at the University of TorontoinToronto,Canada,August19-22,2008. CONCUR2008wasco-located with the 27th Annual ACM SIGACT-SIGOPS Symposium on the Principles of Distributed Computing (PODC 2008), and the two conferences shared two invited speakers, some social events, and a symposium celebrating the lifelong research contributions of Nancy Lynch. The purpose of the CONCUR conferences is to bring together researchers, developers, and students in order to advance the theory of concurrency and promote its applications. Interest in this topic is continuously growing, as a consequence of the importance and ubiquity of concurrent systems and their applications, and of the scienti?c relevance of their foundations. Topics include basic models of concurrency (such as abstract machines, domain theoretic m- els, game theoretic models, process algebras, and Petri nets), logics for c- currency (such as modal logics, temporal logics and resource logics), models of specialized systems (such as biology-inspired systems, circuits, hybrid systems, mobile systems, multi-core processors, probabilistic systems, real-time systems, synchronoussystems, and Web services),veri?cationand analysis techniques for concurrent systems (such as abstract interpretation, atomicity checking, mod- checking, race detection, run-time veri?cation, state-space exploration, static analysis,synthesis,testing, theorem provingand type systems), andrelated p- gramming models (such as distributed or object-oriented). Of the 120 regular and 5 tool papers submitted this year, 33 regular and 2 tool papers were accepted for presentation and areincluded in the present v- ume.
Reihe
Auflage
Sprache
Verlagsort
Verlagsgruppe
Illustrationen
ISBN-13
978-3-540-85361-9 (9783540853619)
DOI
10.1007/978-3-540-85361-9
Schweitzer Klassifikation
Invited Papers.- Beyond Nash Equilibrium: Solution Concepts for the 21st Century.- Service Choreography and Orchestration with Conversations.- Knowledge and Information in Probabilistic Systems.- Taming Concurrency: A Program Verification Perspective.- Contributed Papers.- A Model of Dynamic Separation for Transactional Memory.- Completeness and Nondeterminism in Model Checking Transactional Memories.- Semantics of Deterministic Shared-Memory Systems.- A Scalable and Oblivious Atomicity Assertion.- R-Automata.- Distributed Timed Automata with Independently Evolving Clocks.- A Context-Free Process as a Pushdown Automaton.- Modeling Computational Security in Long-Lived Systems.- Contract-Directed Synthesis of Simple Orchestrators.- Environment Assumptions for Synthesis.- Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning.- SYCRAFT: A Tool for Synthesizing Distributed Fault-Tolerant Programs.- Subsequence Invariants.- Invariants for Parameterised Boolean Equation Systems.- Unfolding-Based Diagnosis of Systems with an Evolving Topology.- On the Construction of Sorted Reactive Systems.- Dynamic Partial Order Reduction Using Probe Sets.- A Space-Efficient Probabilistic Simulation Algorithm.- Least Upper Bounds for Probability Measures and Their Applications to Abstractions.- Abstraction for Stochastic Systems by Erlang's Method of Stages.- On the Minimisation of Acyclic Models.- Quasi-Static Scheduling of Communicating Tasks.- Strategy Construction for Parity Games with Imperfect Information.- Mixing Lossy and Perfect Fifo Channels.- On the Reachability Analysis of Acyclic Networks of Pushdown Systems.- Spatial and Behavioral Types in the Pi-Calculus.- A Spatial Equational Logic for the Applied ?-Calculus.- Structured Interactional Exceptions inSession Types.- Global Progress in Dynamically Interleaved Multiparty Sessions.- Normed BPA vs. Normed BPP Revisited.- A Rule Format for Associativity.- Deriving Structural Labelled Transitions for Mobile Ambients.- Termination Problems in Chemical Kinetics.- Towards a Unified Approach to Encodability and Separation Results for Process Calculi.- A Notion of Glue Expressiveness for Component-Based Systems.
