Anbieter: NEPO UG, Rüsselsheim am Main, Deutschland
Zustand: Gut. 116 Seiten Exemplar aus einer wissenchaftlichen Bibliothek Sprache: Englisch Gewicht in Gramm: 338 23,6 x 16,0 x 1,5 cm, Gebundene Ausgabe.
Anbieter: Lucky's Textbooks, Dallas, TX, USA
EUR 52,72
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: Best Price, Torrance, CA, USA
Zustand: New. SUPER FAST SHIPPING.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 56,20
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
EUR 55,63
Anzahl: 10 verfügbar
In den WarenkorbPaperback. Zustand: New.
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
Zustand: New. 2012. Paperback. . . . . .
Zustand: New. 2012. Paperback. . . . . . Books ship from the US and Ireland.
EUR 48,37
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This monograph aims to provide a powerful general-purpose proof tech nique for the verification of systems, whether finite or infinite. It extends the idea of finite local model-checking, which was introduced by Stirling and Walker: rather than traversing the entire state space of a model, as is done for model-checking in the sense of Emerson, Clarke et ai. (checking whether a (finite) model satisfies a formula), local model-checking asks whether a particular state satisfies a formula, and only explores the nearby states far enough to answer that question. The technique used was a tableau method, constructing a tableau according to the formula and the local structure of the model. This tableau technique is here generalized to the infinite case by considering sets of states, rather than single states; because the logic used, the propositional modal mu-calculus, separates simple modal and boolean connectives from powerful fix-point operators (which make the logic more expressive than many other temporal logics), it is possible to give a rela tively straightforward set of rules for constructing a tableau. Much of the subtlety is removed from the tableau itself, and put into a relation on the state space defined by the tableau-the success of the tableau then depends on the well-foundedness of this relation. The generalized tableau technique is exhibited on Petri nets, and various standard notions from net theory are shown to playa part in the use of the technique on nets-in particular, the invariant calculus has a major role.
Taschenbuch. Zustand: Neu. Verifying Temporal Properties of Systems | J. C. Bradfield | Taschenbuch | VIII | Englisch | 2012 | Birkhäuser | EAN 9781468468212 | Verantwortliche Person für die EU: Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
EUR 97,44
Anzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: Like New. Like New. book.
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
EUR 116,22
Anzahl: 1 verfügbar
In den WarenkorbHardcover. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Verlag: Birkhäuser, Birkhäuser Feb 2012, 2012
ISBN 10: 1468468219 ISBN 13: 9781468468212
Sprache: Englisch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This monograph aims to provide a powerful general-purpose proof tech nique for the verification of systems, whether finite or infinite. It extends the idea of finite local model-checking, which was introduced by Stirling and Walker: rather than traversing the entire state space of a model, as is done for model-checking in the sense of Emerson, Clarke et ai. (checking whether a (finite) model satisfies a formula), local model-checking asks whether a particular state satisfies a formula, and only explores the nearby states far enough to answer that question. The technique used was a tableau method, constructing a tableau according to the formula and the local structure of the model. This tableau technique is here generalized to the infinite case by considering sets of states, rather than single states; because the logic used, the propositional modal mu-calculus, separates simple modal and boolean connectives from powerful fix-point operators (which make the logic more expressive than many other temporal logics), it is possible to give a rela tively straightforward set of rules for constructing a tableau. Much of the subtlety is removed from the tableau itself, and put into a relation on the state space defined by the tableau-the success of the tableau then depends on the well-foundedness of this relation. The generalized tableau technique is exhibited on Petri nets, and various standard notions from net theory are shown to playa part in the use of the technique on nets-in particular, the invariant calculus has a major role. 124 pp. Englisch.
Verlag: Springer-Verlag New York Inc., 2012
ISBN 10: 1468468219 ISBN 13: 9781468468212
Sprache: Englisch
Anbieter: THE SAINT BOOKSTORE, Southport, Vereinigtes Königreich
EUR 66,79
Anzahl: Mehr als 20 verfügbar
In den WarenkorbPaperback / softback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 216.
Verlag: Birkhäuser Boston, Birkhäuser Boston Feb 2012, 2012
ISBN 10: 1468468219 ISBN 13: 9781468468212
Sprache: Englisch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This monograph aims to provide a powerful general-purpose proof tech nique for the verification of systems, whether finite or infinite. It extends the idea of finite local model-checking, which was introduced by Stirling and Walker: rather than traversing the entire state space of a model, as is done for model-checking in the sense of Emerson, Clarke et ai. (checking whether a (finite) model satisfies a formula), local model-checking asks whether a particular state satisfies a formula, and only explores the nearby states far enough to answer that question. The technique used was a tableau method, constructing a tableau according to the formula and the local structure of the model. This tableau technique is here generalized to the infinite case by considering sets of states, rather than single states; because the logic used, the propositional modal mu-calculus, separates simple modal and boolean connectives from powerful fix-point operators (which make the logic more expressive than many other temporal logics), it is possible to give a rela tively straightforward set of rules for constructing a tableau. Much of the subtlety is removed from the tableau itself, and put into a relation on the state space defined by the tableau-the success of the tableau then depends on the well-foundedness of this relation. The generalized tableau technique is exhibited on Petri nets, and various standard notions from net theory are shown to playa part in the use of the technique on nets-in particular, the invariant calculus has a major role.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 124 pp. Englisch.