TEMPORAL LOGICS FOR TRACE SYSTEMS: ON AUTOMATED VERIFICATION

DOI10.1142/S0129054193000043zbMath0783.68081MaRDI QIDQ4275182

Wojciech Penczek

Publication date: 13 January 1994

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

concurrencyautomated verificationpartial order temporal logicstrace systems

Mathematics Subject Classification ID

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

Related Items (8)

Pure future local temporal logics are expressively complete for Mazurkiewicz traces ⋮ Petri nets, traces, and local model checking ⋮ Adding partial orders to linear temporal logic ⋮ Model checking properties on reduced trace systems ⋮ Local temporal logic is expressively complete for cograph dependence alphabets ⋮ From local to global temporal logics over Mazurkiewicz traces. ⋮ Petri nets, traces, and local model checking ⋮ LTL is expressively complete for Mazurkiewicz traces

This page was built for publication: TEMPORAL LOGICS FOR TRACE SYSTEMS: ON AUTOMATED VERIFICATION