Approximately satisfied properties of systems and simple language homomorphisms
From MaRDI portal
Publication:673348
DOI10.1016/S0020-0190(96)00162-7zbMATH Open0900.68297OpenAlexW2048719119MaRDI QIDQ673348FDOQ673348
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
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
\(\omega\)-languagesVerificationFormal languagesLivenessAbstractionApproximate satisfactionCantor topologySafetySimple homomorphisms
Cites Work
Cited In (4)
- Do we need liveness? Approximation of liveness properties by safety properties
- A power-set construction for reducing Büchi automata to non-determinism degree two
- Abstraction and composition: a verification method for co-operating systems
- Approximately satisfied properties of systems and simple language homomorphisms
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)
