Lingua: Inglese
Editore: Princeton University Press, 2016
ISBN 10: 0691634890 ISBN 13: 9780691634890
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 169,14
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Princeton University Press, 2016
ISBN 10: 0691634890 ISBN 13: 9780691634890
Da: Revaluation Books, Exeter, Regno Unito
EUR 249,59
Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 284 pages. 9.00x6.00x0.69 inches. In Stock.
Lingua: Inglese
Editore: Princeton University Press, 2016
ISBN 10: 0691634890 ISBN 13: 9780691634890
Da: moluna, Greven, Germania
EUR 122,33
Quantità: Più di 20 disponibili
Aggiungi al carrelloGebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Über den AutorRobert P. KurshanKlappentextrnrnFormal verification increasingly has become recognized as an answer to the problem of how to create ever more complex control systems, which nonetheless are required .
Lingua: Inglese
Editore: Princeton University Press, US, 2016
ISBN 10: 0691634890 ISBN 13: 9780691634890
Da: Rarewaves USA, OSWEGO, IL, U.S.A.
EUR 187,22
Quantità: Più di 20 disponibili
Aggiungi al carrelloHardback. Condizione: New. 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 development, as well. Originally published in 1995. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.
Lingua: Inglese
Editore: Princeton University Press, 2016
ISBN 10: 0691634890 ISBN 13: 9780691634890
Da: preigu, Osnabrück, Germania
EUR 126,85
Quantità: 5 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Computer-Aided Verification of Coordinating Processes | The Automata-Theoretic Approach | Robert P. Kurshan | Buch | Einband - fest (Hardcover) | Englisch | 2016 | Princeton University Press | EAN 9780691634890 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.
Lingua: Inglese
Editore: Princeton University Press, 2016
ISBN 10: 0691634890 ISBN 13: 9780691634890
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 151,58
Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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 development, as well.Originally published in 1995.The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.
Lingua: Inglese
Editore: Princeton University Press, US, 2016
ISBN 10: 0691634890 ISBN 13: 9780691634890
Da: Rarewaves USA United, OSWEGO, IL, U.S.A.
EUR 188,53
Quantità: Più di 20 disponibili
Aggiungi al carrelloHardback. Condizione: New. 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 development, as well. Originally published in 1995. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.