CONCUR'99. Concurrency Theory 10th International Conference Eindhoven, The Netherlands, August 24-27, 1999 Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Baeten, Jos C.M (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Mauw, Sjouke (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1999.
• Έκδοση: 1st ed. 1999.
• Σειρά: Lecture Notes in Computer Science, 1664
• Θέματα: Applied mathematics.; Engineering mathematics.; Architecture, Computer.; Computer logic.; Computers.; Programming languages (Electronic computers).; Computer programming.; Applications of Mathematics.; Computer System Implementation.; Logics and Meanings of Programs.; Computation by Abstract Devices.; Programming Languages, Compilers, Interpreters.; Programming Techniques.

Πίνακας περιεχομένων:

• 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 of Concurrency
• 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.