scientific article; zbMATH DE number 1927566

zbMATH Open1012.68130MaRDI QIDQ4484491FDOQ4484491

Authors: Martin Lange 

Publication date: 12 June 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2421/24210240.htm

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 2087435
• Three notes on the complexity of model checking fixpoint logic with chop
• scientific article; zbMATH DE number 1304336
• Parallel and symbolic model checking for fixpoint logic with chop
• Non-regular fixed-point logics and games

Mathematics Subject Classification ID

Applications of game theory (91A80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (9)

• Title not available (Why is that?)
• Three notes on the complexity of model checking fixpoint logic with chop
• Temporal Logic with Recursion.
• Non-regular fixed-point logics and games
• Temporal logic with recursion
• Model-Checking Games for Fixpoint Logics with Partial Order Models
• The alternation hierarchy in fixpoint logic with chop is strict too
• Parallel and symbolic model checking for fixpoint logic with chop
• On hierarchically developing reactive systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4484491)