Lattice Automata
From MaRDI portal
Publication:5452607
DOI10.1007/978-3-540-69738-1_14zbMATH Open1132.68455OpenAlexW2913452116MaRDI QIDQ5452607FDOQ5452607
Authors: Orna Kupferman, Yoad Lustig 
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
Recommendations
- Approximating deterministic lattice automata
- Weighted automata and multi-valued logics over arbitrary bounded lattices
- scientific article; zbMATH DE number 2094809
- Finite automata with membership values in lattices and monadic second-order lattice-valued logic
- Multi-valued automata and their applications
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nondeterministic Space is Closed under Complementation
- Reasoning about infinite computations
- Title not available (Why is that?)
- An automata-theoretic approach to branching-time model checking
- Alternating finite automata on \(\omega\)-words
- Weak alternating automata are not that weak
- Theories of automata on \(\omega\)-tapes: a simplified approach
- Title not available (Why is that?)
- Title not available (Why is that?)
- On model checking multiple hybrid views
Cited In (50)
- Simulation for lattice-valued doubly labeled transition systems
- Synthesis from component libraries with costs
- TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
- Algebraic presentation of semifree monads
- Linear-time logics -- a coalgebraic perspective
- Model checking of linear-time properties in multi-valued systems
- Weighted automata and weighted MSO logics for average and long-time behaviors
- Minimizing deterministic lattice automata
- Approximating deterministic lattice automata
- Lattice-valued fuzzy Turing machines: computing power, universality and efficiency
- Title not available (Why is that?)
- Inherent vacuity in lattice automata
- Parameterized model checking of weighted networks
- Bisimulations for fuzzy automata
- On weighted first-order logics with discounting
- Weighted Linear Dynamic Logic
- On Omega-Languages Defined by Mean-Payoff Conditions
- Weighted linear dynamic logic
- Learning and characterizing fully-ordered lattice automata
- Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification
- Temporal specifications with accumulative values
- Vacuity in practice: temporal antecedent failure
- A Weighted μ-Calculus on Words
- Nondeterministic Moore automata and Brzozowski's minimization algorithm
- Model Checking for Action Abstraction
- Measuring and synthesizing systems in probabilistic environments
- Closure properties and complexity of rational sets of regular languages
- Minimizing GFG Transition-Based Automata
- Construction of fuzzy automata from fuzzy regular expressions
- An abstraction-refinement framework for verifying strategic properties in multi-agent systems with imperfect information
- Model checking computation tree logic over finite lattices
- Fuzzy alternating Büchi automata over distributive lattices
- Automata-based axiom pinpointing
- Latticed-LTL synthesis in the presence of noisy inputs
- Title not available (Why is that?)
- Beyond vacuity: towards the strongest passing formula
- Weighted automata
- Computing power of Turing machines in the framework of unsharp quantum logic
- Multi-valued automata and their applications
- Fuzzy alternating automata over distributive lattices
- Latticed Simulation Relations and Games
- Lattice-valued general orthomodular automata
- Equilibrium in two-player stochastic games with shift-invariant payoffs
- Weighted automata and multi-valued logics over arbitrary bounded lattices
- Nondeterministic fuzzy automata with membership values in complete residuated lattices
- Regular Expressions on Average and in the Long Run
- Adding pebbles to weighted automata: easy specification \& efficient evaluation
- The complexity of computing the behaviour of lattice automata on infinite trees
- Multi-Valued Reasoning about Reactive Systems
- Weighted LTL with discounting
This page was built for publication: Lattice Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452607)
