scientific article; zbMATH DE number 1916675

From MaRDI portal

Revision as of 00:54, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

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

Publication:4807834

Jump to:navigation, search

zbMath1030.03025MaRDI QIDQ4807834

Igor Walukiewicz

Publication date: 22 February 2004

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

zbMATH Keywords

\(\mu\)-calculus satisfiability problem traces dependence graph

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

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. ⋮ Difficult configurations -- on the complexity of LTrL

This page was built for publication:

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