scientific article
From MaRDI portal
Publication:2769429
zbMath0978.68096MaRDI QIDQ2769429
Witold Charatonik, Andrew D. Gordon, Supratik Mukhopadhyay, Jean-Marc Talbot, Silvano Dal Zilio
Publication date: 5 February 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2030/20300152
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (5)
Model checking mobile ambients ⋮ Nesting analysis of mobile ambients ⋮ Axiomatisation and decidability of multi-dimensional Duration Calculus ⋮ Deciding Reachability in Mobile Ambients with Name Restriction ⋮ On Model Checking Boolean BI
This page was built for publication:
