scientific article; zbMATH DE number 1927566

MaRDI QIDQ4484491zbMATH OpenFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(11)

• On hierarchically developing reactive systems
• Temporal logic with recursion
• The alternation hierarchy in fixpoint logic with chop is strict too
• Parallel and symbolic model checking for fixpoint logic with chop
• Non-regular fixed-point logics and games
• Model-Checking Games for Fixpoint Logics with Partial Order Models
• scientific article; zbMATH DE number 1304336 (Why is no real title available?)
• scientific article; zbMATH DE number 2087435 (Why is no real title available?)
• Three notes on the complexity of model checking fixpoint logic with chop
• Temporal Logic with Recursion.
• A proof theory of ( -)context-free languages, via non-wellfounded proofs

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)