CONCUR'99. Concurrency Theory (eBook, PDF)

10th International Conference Eindhoven, The Netherlands, August 24-27, 1999 Proceedings
Redaktion: Baeten, Jos C. M.; Mauw, Sjouke

• Format: PDF

Produktbeschreibung

This book constitutes the proceedings of the 10th International Conference on Concurrency Theory, CONCUR'99, held in Eindhoven, The Netherlands in August 1999.The 32 revised full papers presented together with four invited contributions were selected from a total of 91 submissions. The papers address all areas of semantics, logics, and verification techniques for concurrent systems, in particular process algebras, Petri nets, event-structures, real-time systems, hybrid systems, stochastic systems, decidability, model-checking, verification, refinement, term and graph rewriting, distributed programming, logic constraint programming, typing systems, etc.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer Berlin Heidelberg
• Seitenzahl: 584
• Erscheinungstermin: 31. Juli 2003
• Englisch
• ISBN-13: 9783540483205
• Artikelnr.: 53135757

Inhaltsangabe

Invited Lectures.- Temporal Process Logic.- An Unfolding Algorithm for Synchronous Products of Transition Systems.- Petri Nets, Configuration Structures and Higher Dimensional Automata.- Expressiveness and Distributed Implementation of Concurrent Calculi with Link Mobility.- Tutorials.- Techniques for Decidability and Undecidability of Bisimilarity.- Testing Concurrent Systems: A Formal Approach.- Accepted Papers.- Computing Minimum and Maximum Reachability Times in Probabilistic Systems.- Automating Modular Verification.- "Next" Heuristic for On-the-Fly Model Checking.- Model Checking of Message Sequence Charts.- Synthesis of Large Concurrent Programs via Pairwise Composition.- Approximative Symbolic Model Checking of Continuous-Time Markov Chains.- From Synchrony to Asynchrony.- Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic.- Weak and Strong Composition of High-Level Petri Nets.- Model Checking of Time Petri Nets Based on Partial Order Semantics.- Generic Process Algebras for Asynchronous Communication.- Timed Automata and the Theory of Real Numbers.- Metrics for Labeled Markov Systems.- The Expressive Power of Temporal Logic of Actions.- Object Types against Races.- Open Bisimulations on Chi Processes.- Rectangular Hybrid Games.- Localizability of Fairness Constraints and their Distributed Implementations.- Generating Type Systems for Process Graphs.- Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time.- Robust Satisfaction.- Statecharts via Process Algebra.- A Partial Order Event Model for Concurrent Objects.- Partial Order Reduction for Model Checking of Timed Automata.- On the Semantics of Place/Transition Nets.- Validating Firewalls in Mobile Ambients.- On Coherence Properties in Term Rewriting Models ofConcurrency.- Synchronous Structures.- Weakest-Congruence Results for Livelock-Preserving Equivalences.- Proof-Checking Protocols Using Bisimulations.- Event Structures as Presheaves-Two Representation Theorems.- Subtyping and Locality in Distributed Higher Order Processes.