CONCUR'99. Concurrency Theory
Home > Mathematics and Science Textbooks > Mathematics > Applied mathematics > CONCUR'99. Concurrency Theory: 10th International Conference Eindhoven, The Netherlands, August 24-27, 1999 Proceedings(1664 Lecture Notes in Computer Science)
CONCUR'99. Concurrency Theory: 10th International Conference Eindhoven, The Netherlands, August 24-27, 1999 Proceedings(1664 Lecture Notes in Computer Science)

CONCUR'99. Concurrency Theory: 10th International Conference Eindhoven, The Netherlands, August 24-27, 1999 Proceedings(1664 Lecture Notes in Computer Science)


     0     
5
4
3
2
1



International Edition


X
About the Book

This volume contains the proceedings of the 10th International Conference on Concurrency Theory (CONCUR'99) held in Eindhoven, The Netherlands, 24-27 August 1999. ThepurposeoftheCONCURconferencesistobringtogetherresearchers,- velopersandstudentsinordertoadvancethetheoryofconcurrencyandpromote its applications. Interest in this topic is continuously growing, as a consequence oftheimportanceandubiquityofconcurrentsystemsandtheirapplications,and of the scienti?c relevance of their foundations. The scope of CONCUR'99 covers all areas of semantics, logics and veri?cation techniques for concurrent systems. A list of speci?c topics includes (but is not limited to) concurrency-related - pects of: models of computation and semantic domains, process algebras, Petri nets, event structures, real-time systems, hybrid systems, stochastic systems, - cidability, model-checking, veri?cation techniques, re?nement techniques, term and graph rewriting, distributed programming, logic constraint programming, object-oriented programming, typing systems and algorithms, case studies, and tools and environments for programming and veri?cation. The ?rst two CONCUR conferences were held in Amsterdam (NL) in 1990 and 1991, the following ones in Stony Brook (USA), Hildesheim (D), Uppsala (S), Philadelphia (USA), Pisa (I), Warsaw (PL) and Nice (F). The proceedings have appeared in Springer LNCS, as Volumes 458, 527, 630, 715, 836, 962, 1119, 1243, and 1466.

Table of Contents:
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.


Best Sellers


Product Details
  • ISBN-13: 9783540664253
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 584
  • Returnable: Y
  • Sub Title: 10th International Conference Eindhoven, The Netherlands, August 24-27, 1999 Proceedings
  • ISBN-10: 3540664254
  • Publisher Date: 13 Aug 1999
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: 1664 Lecture Notes in Computer Science
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
CONCUR'99. Concurrency Theory: 10th International Conference Eindhoven, The Netherlands, August 24-27, 1999 Proceedings(1664 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
CONCUR'99. Concurrency Theory: 10th International Conference Eindhoven, The Netherlands, August 24-27, 1999 Proceedings(1664 Lecture Notes in Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

CONCUR'99. Concurrency Theory: 10th International Conference Eindhoven, The Netherlands, August 24-27, 1999 Proceedings(1664 Lecture Notes in Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!