Buy Computer-Aided Verification of Coordinating Processes by Robert P. Kurshan
Logo1
Login & Sign up
AddBanner
Home icon Home
Account Icon Account
Wishlist Icon Wishlist
Cart Icon Cart
humburger icon Categories
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Science, Technology & Agriculture > Electronics and communications engineering > Electronics engineering > Automatic control engineering > Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach(Princeton Legacy Library)
Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach(Princeton Legacy Library)

Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach(Princeton Legacy Library)


     0     
5
4
3
2
1
Write Reviews


Out of Stock


Notify me when this book is in stock
X

Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach(Princeton Legacy Library)
The Automata-Theoretic Approach(Princeton Legacy Library)
Format: Hardback

About the Book

Formal verification increasingly has become recognized as an answer to the problem of how to create ever more complex control systems, which nonetheless are required to behave reliably. To be acceptable in an industrial setting, formal verification must be highly algorithmic; to cope with design complexity, it must support a top-down design methodology that leads from an abstract design to its detailed implementation. That combination of requirements points directly to the widely recognized solution of automata-theoretic verification, on account of its expressiveness, computational complexity, and perhaps general utility as well. This book develops the theory of automata-theoretic verification from its foundations, with a focus on algorithms and heuristics to reduce the computational complexity of analysis. It is suitable as a text for a one- or two- semester graduate course, and is recommended reading for anyone planning to use a verification tool, such as COSPAN or SMV. An extensive bibliography that points to the most recent sources, and extensive discussions of methodology and comparisons with other techniques, make this a useful resource for research or verification tool devel

Table of Contents:

Preface Introduction
2 Boolean Algebra
3 L-matrix
4 L-language
5 String Acceptors
6 [omega]-theory: L-automaton/L-process
7 The Selection/Resolution Model
8 Reduction of Verification
9 Structural Induction
10 Binary Decision Diagrams
Appendices
Bibliography
Glossary
Index

Review :
A self-contained introduction for anyone familiar with the fundamentals of the theory of machines. The book is well indexed and contains a substantial bibliography, as well as pointing to the implementation of the verification techniques in the COSPAN system. Computing Reviews

Best Sellers

See All
Too Good To Be True
Quick View

Too Good To Be True Prajakta Koli

4.3 (6)

AED33

Thank You for Leaving
Quick View

Thank You for Leaving Rithvik Singh

2 (5)

AED31

Atomic Habits (EXP)
Quick View

Atomic Habits (EXP) James Clear

No Review Yet

AED74

My First Library
Quick View

My First Library

4.1 (8)

AED51

Dopamine Detox
Quick View

Dopamine Detox Thibaut Meurisse

No Review Yet

AED29

Money Myths and Mantras
Quick View

Money Myths and Mantras Devina Mehra

4.7 (3)

AED32

Meditations
Quick View

Meditations Marcus Aurelius

4.3 (6)

AED28

Harry Potter Box Set: The Complete Collection (Children’s Paperback)
Quick View

Harry Potter Box Set: The Complete Collection (Children’s Paperback) J.K. Rowling

4.3 (8)

AED203

Atomic Habits
Quick View

Atomic Habits James Clear

4.6 (5)

AED45

The Art of Being Alone
Quick View

The Art of Being Alone Renuka Gavrani

5 (6)

AED31

Animals Tales From Panchtantra
Quick View

Animals Tales From Panchtantra

4.5 (10)

AED32

My First Book of Patterns Pencil Control
Quick View

My First Book of Patterns Pencil Control No Author

4.6 (8)

AED21

Product Details
  • ISBN-13: 9780691034362
  • Publisher: Princeton University Press
  • Publisher Imprint: Princeton University Press
  • Height: 254 mm
  • No of Pages: 272
  • Returnable: Y
  • Series Title: Princeton Series in Computer Science
  • Weight: 482 gr
  • ISBN-10: 0691034362
  • Publisher Date: 26 Feb 1995
  • Binding: Hardback
  • Language: English
  • Returnable: Y
  • Series Title: Princeton Legacy Library
  • Sub Title: The Automata-Theoretic Approach
  • Width: 197 mm

Similar Products

Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach(Princeton Legacy Library)
Princeton University Press -
Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach(Princeton Legacy Library)
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.

Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach(Princeton Legacy Library)

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

    See All

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!