Simulation-based minimization

DOI10.1145/635499.635502zbMath1365.68319OpenAlexW2076334860MaRDI QIDQ5267428

Orna Grumberg, Doron Bustan

Publication date: 13 June 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/635499.635502

zbMATH Keywords

simulationminimization

Mathematics Subject Classification ID

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

Related Items (13)

An Algorithm for Probabilistic Alternating Simulation ⋮ Abstraction and Abstraction Refinement ⋮ Parity game reductions ⋮ Strong simulation ⋮ A Simpler Alternative: Minimizing Transition Systems Modulo Alternating Simulation Equivalence ⋮ Correcting a Space-Efficient Simulation Algorithm ⋮ Generalizing the Paige-Tarjan algorithm by abstract interpretation ⋮ An efficient simulation algorithm on Kripke structures ⋮ An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation ⋮ Modular mix-and-match complementation of Büchi automata ⋮ Simulations in rank-based Büchi automata complementation ⋮ Game-theoretic simulation checking tool ⋮ An efficient simulation algorithm based on abstract interpretation

This page was built for publication: Simulation-based minimization