scientific article; zbMATH DE number 1927566
From MaRDI portal
Publication:4484491
zbMath1012.68130MaRDI QIDQ4484491
Publication date: 12 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2421/24210240.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of game theory (91A80) 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) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (5)
On hierarchically developing reactive systems ⋮ Temporal Logic with Recursion. ⋮ Three notes on the complexity of model checking fixpoint logic with chop ⋮ The alternation hierarchy in fixpoint logic with chop is strict too ⋮ Temporal logic with recursion
This page was built for publication:
