scientific article; zbMATH DE number 1980931

zbMath1023.68624MaRDI QIDQ4428305

Moshe Y. Vardi, Nir Piterman, Orna Kupferman

Publication date: 15 September 2003

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Model-checking structured context-free languages ⋮ Complexity results on branching-time pushdown model checking ⋮ Ordered multi-stack visibly pushdown automata ⋮ Enriched μ–Calculus Pushdown Module Checking ⋮ Efficient CTL model-checking for pushdown systems ⋮ Interval Temporal Logic for Visibly Pushdown Systems ⋮ Model checking probabilistic systems against pushdown specifications ⋮ Unnamed Item ⋮ Operator precedence temporal logic and model checking ⋮ Model checking properties on reduced trace systems ⋮ Distributed synthesis for regular and contextfree specifications ⋮ Cycle detection in computation tree logic ⋮ Unnamed Item ⋮ Efficient CTL Model-Checking for Pushdown Systems ⋮ Context-free timed formalisms: robust automata and linear temporal logics