Volltextsuche nutzen

B O O K SCREENER

Aktuelle Veranstaltungen

Events
  • versandkostenfrei ab € 30,–
  • 11x in Wien, NÖ und Salzburg
  • 6 Mio. Bücher
Menü
Towards an Isabelle Theory for distributed, interactive systems

Towards an Isabelle Theory for distributed, interactive systems

The untimed case

Towards an Isabelle Theory for distributed, interactive systems
Taschenbuch 35,80
Taschenbuch
35,80
inkl. gesetzl. MwSt.
Besorgungstitel
Lieferzeit 1-2 Wochen
Versandkostenfreibestellen in Österreich
Deutschland: € 10,00
EU & Schweiz: € 20,00
In den Warenkorb
Click & Collect
Artikel online bestellen und in der Filiale abholen.
Artikel in den Warenkorb legen, zur Kassa gehen und Wunschfiliale auswählen. Lieferung abholen und bequem vor Ort bezahlen.
Derzeit in keiner facultas Filiale lagernd. Jetzt online bestellen!
Auf die Merkliste

Veröffentlicht 2020, von Sebastian Stüber, Deni Raco, Jens Christoph Bürger, Hendrik Kausch, Jan Oliver Ringert, Marc Wiartalla, Prof. Dr. rer. nat. Bernhard Rumpe(Hg.) bei Shaker

ISBN: 978-3-8440-7265-5
Auflage: 1. Auflage
Reihe: Aachener Informatik Berichte Software Engineering
260 Seiten
24 cm x 17 cm

 
This report describes a specification and verification framework for distributed interactive systems. The framework encodes the untimed part of the formal methodology FOCUS in the proof assistant Isabelle using domain-theoretical concepts. The key concept of FOCUS, the stream data type, together with the corresponding prefix-order, is formalized as a pointed complete partial order.
Furthermore, a ...
Beschreibung
This report describes a specification and verification framework for distributed interactive systems. The framework encodes the untimed part of the formal methodology FOCUS in the proof assistant Isabelle using domain-theoretical concepts. The key concept of FOCUS, the stream data type, together with the corresponding prefix-order, is formalized as a pointed complete partial order.
Furthermore, a high-level API is provided to hide the explicit usage of domain theoretical concepts by the user in typical proofs.
Realizability constraints for modeling component networks with potential feedback loops are implemented. Moreover, a set of commonly used functions on streams are defined as least fixed points of the corresponding functionals and are proven to be prefix-continuous.

As a second key concept the stream processing function (SPF) is introduced describing a statefull, deterministic behavior of a message-passing component. The denotational semantics of components in this work is a defined set of stream processing functions, each of which maps input streams to output streams.

Furthermore, an extension of the framework is presented by using an isomorphic transformation of tuples of streams to model component interfaces and allowing composition. The structures for modeling component networks are implemented by giving names to channels and defining composition operators. This is motivated by the advantage that a modular modeling of component networks offers, based on the correctness of components of the decomposed system and using proper composition operators, the correctness of the whole system is automatically derived by construction.

Finally, a running example extracted from a controller in a car is realized to demonstrate and validate the framework.