Computer aided verification coordinating processes de kurshan robert (12 resultados)

Autor
Título
Refinar con la Búsqueda avanzada

Filtrar la búsqueda

  • Libros (12)

  • Nuevo (12)

a

Intervalo de precios personalizado (EUR)

a

  • Idioma: Inglés

    Editorial: Princeton University Press, 2014

    0691606056 / 9780691606057

    • Tapa blanda

    Librería: Books Puddle, Woodside, NY, Estados Unidos de AmericaBooks Puddle

    Vendedor de 4 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 56,47

    Envío por EUR 3,49 
    Se envía dentro de Estados Unidos de America

    Cantidad disponible: 3 disponibles

    Condición: New. pp. 284.

  • Idioma: Inglés

    Editorial: Princeton University Press, 2014

    0691606056 / 9780691606057

    • Tapa blanda

    Librería: Revaluation Books, Exeter, Reino UnidoRevaluation Books

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 102,30

    Envío por EUR 11,66 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: 2 disponibles

    Paperback. Condición: Brand New. 284 pages. 9.21x6.14x1.00 inches. In Stock.

  • Idioma: Inglés

    Editorial: Princeton University Press, US, 2014

    0691606056 / 9780691606057

    • Tapa blanda
    • Impresión bajo demanda

    Librería: Rarewaves USA, HEBRON, KY, Estados Unidos de AmericaRarewaves USA

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 69,53

     Gastos de envío gratis 
    Se envía dentro de Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Paperback. Condición: 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.

  • Idioma: Inglés

    Editorial: Princeton University Press, US, 2014

    0691606056 / 9780691606057

    • Tapa blanda
    • Impresión bajo demanda

    Librería: Rarewaves USA United, HEBRON, KY, Estados Unidos de AmericaRarewaves USA United

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 71,99

    Envío por EUR 43,68 
    Se envía dentro de Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Paperback. Condición: 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.

  • Idioma: Inglés

    Editorial: Princeton University Press, 2014

    0691606056 / 9780691606057

    • Tapa blanda
    • Impresión bajo demanda

    Librería: moluna, Greven, Alemaniamoluna

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 72,51

    Envío por EUR 48,99 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. &Uumlber den AutorRobert P. KurshanInhaltsverzeichnisPreface Introduction 2Boolean Algebra 3L-matrix 4L-language 5String Acceptors 6[omega]-theory: L-automaton/L-process 7The Selection/Resolution Model 8Reduc.

  • Idioma: Inglés

    Editorial: Princeton University Press, 2014

    0691606056 / 9780691606057

    • Tapa blanda
    • Impresión bajo demanda

    Librería: preigu, Osnabrück, Alemaniapreigu

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 75,25

    Envío por EUR 70,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 5 disponibles

    Taschenbuch. Condición: Neu. Computer-Aided Verification of Coordinating Processes | The Automata-Theoretic Approach | Robert P. Kurshan | Taschenbuch | Einband - flex.(Paperback) | Englisch | 2014 | Princeton University Press | EAN 9780691606057 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.

  • Idioma: Inglés

    Editorial: Princeton University Press, US, 2016

    0691634890 / 9780691634890

    • Tapa dura
    • Impresión bajo demanda

    Librería: Rarewaves USA, HEBRON, KY, Estados Unidos de AmericaRarewaves USA

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 182,68

     Gastos de envío gratis 
    Se envía dentro de Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Hardback. Condición: 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.

  • Idioma: Inglés

    Editorial: Princeton University Press, 2014

    0691606056 / 9780691606057

    • Tapa blanda
    • Impresión bajo demanda

    Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 148,74

    Envío por EUR 35,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 1 disponibles

    Taschenbuch. Condición: 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.

  • Idioma: Inglés

    Editorial: Princeton University Press, US, 2016

    0691634890 / 9780691634890

    • Tapa dura
    • Impresión bajo demanda

    Librería: Rarewaves USA United, HEBRON, KY, Estados Unidos de AmericaRarewaves USA United

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 176,44

    Envío por EUR 43,68 
    Se envía dentro de Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Hardback. Condición: 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.

  • Idioma: Inglés

    Editorial: Princeton University Press, 2016

    0691634890 / 9780691634890

    • Tapa dura
    • Impresión bajo demanda

    Librería: moluna, Greven, Alemaniamoluna

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 178,60

    Envío por EUR 48,99 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Gebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. &Uumlber 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 .

  • Idioma: Inglés

    Editorial: Princeton University Press, 2016

    0691634890 / 9780691634890

    • Tapa dura
    • Impresión bajo demanda

    Librería: preigu, Osnabrück, Alemaniapreigu

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 185,15

    Envío por EUR 70,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 5 disponibles

    Buch. Condición: Neu. Computer-Aided Verification of Coordinating Processes | The Automata-Theoretic Approach | Robert P. Kurshan | Buch | 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.

  • Idioma: Inglés

    Editorial: Princeton University Press, 2016

    0691634890 / 9780691634890

    • Tapa dura
    • Impresión bajo demanda

    Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 363,16

    Envío por EUR 35,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 1 disponibles

    Buch. Condición: 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.