scientific article; zbMATH DE number 1956507
From MaRDI portal
Publication:4417853
zbMath1029.68104MaRDI QIDQ4417853
Amir Pnueli, Tamarah Arons, Lenore D. Zuck
Publication date: 30 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2620/26200087.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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 (8)
Model checking and abstraction to the aid of parameterized systems (a survey) ⋮ On the Hardness of Almost–Sure Termination ⋮ Unnamed Item ⋮ Time-bounded termination analysis for probabilistic programs with delays ⋮ On the hardness of analyzing probabilistic programs ⋮ Liveness by Invisible Invariants ⋮ An Inductive Technique for Parameterised Model Checking of Degenerative Distributed Randomised Protocols ⋮ Quantitative Analysis under Fairness Constraints
This page was built for publication:
