Approximately satisfied properties of systems and simple language homomorphisms
From MaRDI portal
Publication:673348
DOI10.1016/S0020-0190(96)00162-7zbMath0900.68297MaRDI QIDQ673348
Ulrich Nitsche, Peter Ochsenschläger
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
\(\omega\)-languages; Verification; Formal languages; Liveness; Abstraction; Approximate satisfaction; Cantor topology; Safety; Simple homomorphisms
68Q55: Semantics in the theory of computing
Related Items
Abstraction and composition: a verification method for co-operating systems, Approximately satisfied properties of systems and simple language homomorphisms, A power-set construction for reducing Büchi automata to non-determinism degree two
Cites Work