Bridging the gap between fair simulation and trace inclusion

DOI10.1016/j.ic.2005.01.006zbMath1082.68055OpenAlexW2149191071MaRDI QIDQ2486398

Nir Piterman, Amir Pnueli, Yonit Kesten

Publication date: 5 August 2005

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

Full work available at URL: http://hdl.handle.net/2381/10276

zbMATH Keywords

Fair simulationStreett automataTrace inclusion

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Taming Dr. Frankenstein: contract-based design for cyber-physical systems ⋮ Synthesis of Reactive(1) designs ⋮ Learning Meets Verification ⋮ GR(1)*: GR(1) specifications extended with existential guarantees

Uses Software

• STeP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• The existence of refinement mappings
• Theories of automata on \(\omega\)-tapes: a simplified approach
• Reasoning about infinite computations
• Fast and simple nested fixpoints
• Verification by augmented finitary abstraction
• Fair simulation
• Control and data abstraction: The cornerstones of practical formal verification
• Transformational design and implementation of a new efficient solution to the ready simulation problem
• Verification of concurrent programs: The automata-theoretic framework
• Temporal logic can be more expressive
• Exponential Determinization for ω‐Automata with a Strong Fairness Acceptance Condition
• Propositional dynamic logic of looping and converse is elementarily decidable
• CONCUR 2003 - Concurrency Theory
• Computer Aided Verification

This page was built for publication: Bridging the gap between fair simulation and trace inclusion