Description

Book Synopsis
Fairness and Liveness under Weak Consistency.- Restricted Flow Games.- SynthLearn: a Tool for Guided Reactive Synthesis.- On Regular Expression Proof Complexity of Salomaa's Axiom System F1.- Hidden Markov Models with Unobservable Transitions.- Coverability in Well-Formed Free-Choice Petri Nets.- Devillers On verifying concurrent programs under weak consistency models: Decidability and Complexity.- A Summary and Personal Perspective on Recent Advances in Privacy Risk Assessment in Digital Pathology through Formal Methods.- A Uniform Framework for Language Inclusion Problems.- On the Home-Space Problem for Petri Nets.- Leroux Newton's Method There and Back Again.- Template-Based Verification of Array-Manipulating Programs.- Memoryless Strategies in Stochastic Reachability Games.- Region Quadtrees Verified.- Computing pre* for General Context Free Languages.- 2-Pointer Logic.

Taming the Infinities of Concurrency

    Product form

    £98.99

    Includes FREE delivery

    RRP £109.99 – you save £11.00 (10%)

    Order before 4pm today for delivery by Mon 22 Jun 2026.

    A Paperback by Stefan Kiefer

    Out of stock

      Trusted by thousands of customers. See 2,385+ Customer Reviews

      View other formats and editions of Taming the Infinities of Concurrency by Stefan Kiefer

      Publisher: Springer
      Publication Date: 3/20/2024
      ISBN13: 9783031562211, 978-3031562211
      ISBN10: 3031562216

      Description

      Book Synopsis
      Fairness and Liveness under Weak Consistency.- Restricted Flow Games.- SynthLearn: a Tool for Guided Reactive Synthesis.- On Regular Expression Proof Complexity of Salomaa's Axiom System F1.- Hidden Markov Models with Unobservable Transitions.- Coverability in Well-Formed Free-Choice Petri Nets.- Devillers On verifying concurrent programs under weak consistency models: Decidability and Complexity.- A Summary and Personal Perspective on Recent Advances in Privacy Risk Assessment in Digital Pathology through Formal Methods.- A Uniform Framework for Language Inclusion Problems.- On the Home-Space Problem for Petri Nets.- Leroux Newton's Method There and Back Again.- Template-Based Verification of Array-Manipulating Programs.- Memoryless Strategies in Stochastic Reachability Games.- Region Quadtrees Verified.- Computing pre* for General Context Free Languages.- 2-Pointer Logic.

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account