ASM refinement and generalizations of forward simulation in data refinement: a comparison

DOI10.1016/j.tcs.2004.11.013zbMath1080.68058OpenAlexW2048884567MaRDI QIDQ555790

Gerhard Schellhorn

Publication date: 10 June 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.11.013

zbMATH Keywords

RefinementAbstract state machinesData refinement

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (12)

Construction and analysis of ground models and their refinements as a foundation for validating computer-based systems ⋮ The Subject-Oriented Approach to Software Design and the Abstract State Machines Method ⋮ Completeness of ASM Refinement ⋮ Completeness of fair ASM refinement ⋮ Atomic actions, and their refinements to isolated protocols ⋮ Safe abstractions of data encodings in formal security protocol models ⋮ Introducing extra operations in refinement ⋮ Continuous KAOS, ASM, and formal control system design across the continuous/discrete modeling interface: a simple train stopping application ⋮ Relational concurrent refinement. II: Internal operations and outputs ⋮ Verification of compliance for multilevel models in individual trace semantics ⋮ Understanding, Explaining, and Deriving Refinement ⋮ Moded and continuous abstract state machines

Uses Software

• TLA
• KIV
• Z
• Piton

Cites Work

• The ASM refinement method
• Forward and backward simulations. I. Untimed Systems
• The B-Book
• Data Refinement
• Evolving Algebras 1993: Lipari Guide
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: ASM refinement and generalizations of forward simulation in data refinement: a comparison