scientific article

From MaRDI portal

Revision as of 14:24, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2754145

Jump to:navigation, search

zbMath0973.68165MaRDI QIDQ2754145

Volker Diekert, Paul Gastin

Publication date: 11 November 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)

Related Items (4)

Local temporal logic is expressively complete for cograph dependence alphabets ⋮ Difficult configurations -- on the complexity of LTrL ⋮ Weighted Automata and Logics on Infinite Graphs ⋮ LTL is expressively complete for Mazurkiewicz traces

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2754145&oldid=15626930"