Concur 2014 - Concurrency Theory by Paolo (EDT) Baldan
Home > Computer & Internet > Computer programming / software development > Program concepts / learning to program > Concur 2014 - Concurrency Theory
Concur 2014 - Concurrency Theory

Concur 2014 - Concurrency Theory


     0     
5
4
3
2
1



International Edition


About the Book

Laws of Programming: The Algebraic Unification of Theories of Concurrency.- The Benefits of Sometimes Not Being Discrete.- Deterministic Negotiations: Concurrency for Free.- Generalized Bisimulation Metrics.- Choreographies, Logically.- Deadlock Analysis of Unbounded Process Networks.- Trees from Functions as Processes.- Bisimulations Up-to: Beyond First-Order Transition Systems.- Parameterized Model Checking of Rendezvous Systems.- On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability.- Lost in Abstraction: Monotonicity in Multi-threaded Programs.- Synthesis from Component Libraries with Costs.- Compositional Controller Synthesis for Stochastic Games.- Synchronizing Strategies under Partial Observability.- Probabilistic Robust Timed Games.- Perturbation Analysis in Verification of Discrete-Time Markov Chains.- Robust Synchronization in Markov Decision Processes.- Probabilistic Bisimulation: Naturally on Distributions.- Averaging in LTL.- Decidable Topologies for Communicating Automata with FIFO and Bag Channels.- Controllers for the Verification of Communicating Multi-pushdown Systems.- Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking.- A Linear-Time Algorithm for the Orbit Problem over Cyclic Groups.- A Nearly Optimal Upper Bound for the Self-Stabilization Time in Herman's Algorithm.- Bounds on Mobility.- Typing Messages for Free in Security Protocols: The Case of Equivalence Properties.- Using Higher-Order Contracts to Model Session Types (Extended Abstract).- A Semantic Deconstruction of Session Types.- Timed Multiparty Session Types.- A Categorical Semantics of Signal Flow Graphs.- Generic Forward and Backward Simulations III: Quantitative Simulations by Matrices.- A General Framework for Well-Structured Graph Transformation Systems.- (Un)decidable Problems about Reachability of Quantum Systems.- Ordered Navigation on Multi-attributed Data Words.- Verification for Timed Automata Extended with Unbounded Discrete Data Structures.- Reducing Clocks in Timed Automata while Preserving Bisimulation.- Qualitative Concurrent Parity Games: Bounded Rationality.- Adding Negative Prices to Priced Timed Games.- Tight Game Abstractions of Probabilistic Automata.


Best Sellers



Product Details
  • ISBN-13: 9783662445839
  • Publisher: Springer
  • Publisher Imprint: Springer
  • Depth: 32
  • Height: 234 mm
  • No of Pages: 594
  • Series Title: Lecture Notes in Computer Science / Theoretical Computer Science and General Issues
  • Sub Title: 25th International Conference, Concur 2014, Rome, Italy, September 2-5, 2014. Proceedings
  • Width: 156 mm
  • ISBN-10: 3662445832
  • Publisher Date: 06 Aug 2014
  • Binding: Paperback
  • Edition: 2014 ed.
  • Language: English
  • Returnable: N
  • Spine Width: 32 mm
  • Weight: 902 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Concur 2014 - Concurrency Theory
Springer -
Concur 2014 - Concurrency Theory
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 2014 - Concurrency Theory

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!