scientific article; zbMATH DE number 1956507
From MaRDI portal
Publication:4417853
zbMATH Open1029.68104MaRDI QIDQ4417853FDOQ4417853
Authors: Tamarah Arons, Amir Pnueli, 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 of this publication is not available (Why is that?)
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (15)
- Liveness by Invisible Invariants
- Liveness Reasoning with Isabelle/HOL
- Time-bounded termination analysis for probabilistic programs with delays
- Title not available (Why is that?)
- On the hardness of almost-sure termination
- A counter abstraction technique for verifying properties of probabilistic swarm systems
- Quantitative analysis under fairness constraints
- On the hardness of analyzing probabilistic programs
- Liveness of randomised parameterised systems under arbitrary schedulers
- Model checking and abstraction to the aid of parameterized systems (a survey)
- Title not available (Why is that?)
- An inductive technique for parameterised model checking of degenerative distributed randomised protocols
- \(P^5\): planner-less proofs of probabilistic parameterized protocols
- Checking qualitative liveness properties of replicated systems with stochastic scheduling
- Fair termination for parameterized probabilistic concurrent systems
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 Q4417853)
