Approximately satisfied properties of systems and simple language homomorphisms

DOI10.1016/S0020-0190(96)00162-7zbMath0900.68297OpenAlexW2048719119MaRDI QIDQ673348

Ulrich Nitsche, Peter Ochsenschläger

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(96)00162-7

zbMATH Keywords

\(\omega\)-languagesVerificationFormal languagesLivenessAbstractionApproximate satisfactionCantor topologySafetySimple homomorphisms

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (3)

Abstraction and composition: a verification method for co-operating systems ⋮ A power-set construction for reducing Büchi automata to non-determinism degree two ⋮ Approximately satisfied properties of systems and simple language homomorphisms

Cites Work

• Approximately satisfied properties of systems and simple language homomorphisms
• The existence of refinement mappings
• Defining liveness
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximately satisfied properties of systems and simple language homomorphisms