Equivalences for fair Kripke structures

DOI10.1007/3-540-58201-0_82MaRDI QIDQ4632440zbMATH OpenOpenAlexFDO

Authors Adnan Aziz, Vigyan Singhal, Felice Balarin, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli

Publication date 29 April 2019

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58201-0_82

zbMATH Keywords

atomic propositionKripke structurelinear-time temporal logicmodel checkingstate formula

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 177255
• scientific article; zbMATH DE number 1538045
• scientific article; zbMATH DE number 177516
• scientific article; zbMATH DE number 4016870
• Fair equivalence relations

Cites work

• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Characterizing finite Kripke structures in propositional temporal logic
• “Sometimes” and “not never” revisited

Cited in

(10)

• Towards categorical models for fairness: Fully abstract presheaf semantics of SCCS with finite delay
• Fair simulation
• Applicability of fair simulation
• scientific article; zbMATH DE number 177255 (Why is no real title available?)
• scientific article; zbMATH DE number 177516 (Why is no real title available?)
• scientific article; zbMATH DE number 2080199 (Why is no real title available?)
• Fair equivalence relations
• Liveness, Fairness and Impossible Futures
• On the complexity of verifying concurrent transition systems
• Fair simulation

This page was built for publication: Equivalences for fair Kripke structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632440)