Anzeige
Erschienen in:
2018 | OriginalPaper | Buchkapitel
1. Labeled Transition Systems and Their Refinement
verfasst von : John Derrick, Eerke Boiten
Erschienen in: Refinement
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
On purpose we start with one of the simplest models of computation, that given by labeled transition systems. After introducing the reader to this simple set up we start to explore what refinement might mean, beginning with trace refinement, then adding in various notions such as refusals, so that each refinement relation we introduce is more discriminating than the last. The most discriminating of all, bisimulation, will then be introduced in Chap. 2. The material in this chapter serves as the foundation of refinement in process algebras such as CSP, CCS and LOTOS which we consider in Chap. 6.