Lattice Automata

DOI10.1007/978-3-540-69738-1_14zbMath1132.68455OpenAlexW2913452116MaRDI QIDQ5452607

Yoad Lustig, Orna Kupferman

Publication date: 4 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69738-1_14

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (44)

Multi-Valued Reasoning about Reactive Systems ⋮ Weighted LTL with Discounting ⋮ Latticed-LTL synthesis in the presence of noisy inputs ⋮ Fuzzy alternating Büchi automata over distributive lattices ⋮ Temporal Specifications with Accumulative Values ⋮ Inherent Vacuity in Lattice Automata ⋮ Closure properties and complexity of rational sets of regular languages ⋮ Weighted automata and weighted MSO logics for average and long-time behaviors ⋮ Equilibrium in two-player stochastic games with shift-invariant payoffs ⋮ An abstraction-refinement framework for verifying strategic properties in multi-agent systems with imperfect information ⋮ Model checking computation tree logic over finite lattices ⋮ Weighted Linear Dynamic Logic ⋮ Latticed Simulation Relations and Games ⋮ Learning and characterizing fully-ordered lattice automata ⋮ Bisimulations for fuzzy automata ⋮ Nondeterministic Moore automata and Brzozowski's minimization algorithm ⋮ Unnamed Item ⋮ Adding pebbles to weighted automata: easy specification \& efficient evaluation ⋮ The complexity of computing the behaviour of lattice automata on infinite trees ⋮ Parameterized model checking of weighted networks ⋮ On weighted first-order logics with discounting ⋮ Computing power of Turing machines in the framework of unsharp quantum logic ⋮ Nondeterministic fuzzy automata with membership values in complete residuated lattices ⋮ Synthesis from component libraries with costs ⋮ Beyond vacuity: towards the strongest passing formula ⋮ Construction of fuzzy automata from fuzzy regular expressions ⋮ Automata-based axiom pinpointing ⋮ Vacuity in practice: temporal antecedent failure ⋮ Model checking of linear-time properties in multi-valued systems ⋮ Unnamed Item ⋮ Model Checking for Action Abstraction ⋮ On Omega-Languages Defined by Mean-Payoff Conditions ⋮ Regular Expressions on Average and in the Long Run ⋮ Minimizing Deterministic Lattice Automata ⋮ TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS ⋮ A Weighted μ-Calculus on Words ⋮ Minimizing GFG Transition-Based Automata ⋮ Weighted automata and multi-valued logics over arbitrary bounded lattices ⋮ Weighted automata ⋮ Lattice-valued fuzzy Turing machines: computing power, universality and efficiency ⋮ Fuzzy alternating automata over distributive lattices ⋮ Measuring and Synthesizing Systems in Probabilistic Environments ⋮ Algebraic presentation of semifree monads ⋮ Simulation for lattice-valued doubly labeled transition systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Alternating finite automata on \(\omega\)-words
• On model checking multiple hybrid views
• Theories of automata on \(\omega\)-tapes: a simplified approach
• Reasoning about infinite computations
• Weak alternating automata are not that weak
• Nondeterministic Space is Closed under Complementation
• An automata-theoretic approach to branching-time model checking

This page was built for publication: Lattice Automata