Approximately satisfied properties of systems and simple language homomorphisms

DOI10.1016/S0020-0190(96)00162-7MaRDI QIDQ673348zbMATHOpenAlexFDO

Authors 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)

Recommendations

• Finite approximatization of languages for representation of system properties: Axiomatization of dependencies
• Approximate satisfiability and equivalence
• On sufficient-completeness and related properties of term rewriting systems
• Decidable approximations of term rewriting systems
• A simple P-complete problem and its language-theoretic representations
• Finite Approximations and Similarity of Languages
• Satisfiability and meaning of formulas and sets of formulas in approximation spaces
• Transition of consistency and satisfiability under language extensions
• Deterministic Algorithms, Simple Languages And One‐to‐One Gentzen Type Formalizations
• Satisfaction for n-th order languages defined in n-th order languages

Cites work

• scientific article; zbMATH DE number 3112450 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• Approximately satisfied properties of systems and simple language homomorphisms
• Defining liveness
• The existence of refinement mappings

Cited in

(4)

• 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
• Do we need liveness? Approximation of liveness properties by safety properties

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673348)