scientific article; zbMATH DE number 1223711
From MaRDI portal
Publication:4219025
zbMath0909.03024MaRDI QIDQ4219025
Publication date: 14 February 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modal logic (including the logic of norms) (03B45) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (10)
Realizability of high-level message sequence charts: closing the gaps ⋮ Undecidability of partial order logics ⋮ Pure future local temporal logics are expressively complete for Mazurkiewicz traces ⋮ Temporal BI: proof system, semantics and translations ⋮ Local temporal logic is expressively complete for cograph dependence alphabets ⋮ From local to global temporal logics over Mazurkiewicz traces. ⋮ An expressively complete linear time temporal logic for Mazurkiewicz traces ⋮ Efficient model checking for LTL with partial order snapshots ⋮ Bounded linear-time temporal logic: a proof-theoretic investigation ⋮ LTL is expressively complete for Mazurkiewicz traces
This page was built for publication:
