Applicability of fair simulation

DOI10.1016/j.ic.2004.02.005zbMath1070.68089OpenAlexW2060747467MaRDI QIDQ1886036

Doron Bustan, Orna Grumberg

Publication date: 12 November 2004

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2004.02.005

zbMATH Keywords

PreorderMinimizationAssume-guaranteeBranching time logicsFair simulation

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

Verification of initial-state opacity in security applications of discrete event systems

Cites Work

• Characterizing finite Kripke structures in propositional temporal logic
• Defining conditional independence using collapses
• Property preserving abstractions for the verification of concurrent systems
• Fair simulation
• Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata
• Algebraic laws for nondeterminism and concurrency
• Proofs of Networks of Processes
• Equivalences for fair Kripke structures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Applicability of fair simulation