LATTICED SIMULATION RELATIONS AND GAMES

DOI10.1142/S0129054110007192zbMath1200.68155OpenAlexW2076938770MaRDI QIDQ3552519

Yoad Lustig, Orna Kupferman

Publication date: 22 April 2010

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054110007192

zbMATH Keywords

latticed Kripke structureslatticed two-player games

Mathematics Subject Classification ID

2-person games (91A05) Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (9)

Bisimulations for fuzzy transition systems revisited ⋮ Latticed-LTL synthesis in the presence of noisy inputs ⋮ Convex lattice equation systems ⋮ Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems ⋮ Logical characterizations of simulation and bisimulation for fuzzy transition systems ⋮ Approximate bisimulation relations for fuzzy automata ⋮ Minimizing Deterministic Lattice Automata ⋮ Unnamed Item ⋮ Simulation for lattice-valued doubly labeled transition systems

Cites Work

• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• Fair simulation

This page was built for publication: LATTICED SIMULATION RELATIONS AND GAMES