A Synthesis of Two Approaches for Verifying Finite State Concurrent Systems

DOI10.1093/logcom/2.5.605zbMath0782.68078OpenAlexW1988027993MaRDI QIDQ5285990

Orna Grumberg, Robert Kurshan, Edmund M. Clarke

Publication date: 29 June 1993

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/2.5.605

zbMATH Keywords

model checkingtemporal logics\(\omega\)-regular languagesfinite-state systemsautomata on infinite tapes

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

Stochastic game logic ⋮ Verification of reactive systems using temporal logic with clocks

This page was built for publication: A Synthesis of Two Approaches for Verifying Finite State Concurrent Systems