scientific article
From MaRDI portal
Publication:3746869
zbMath0607.68012MaRDI QIDQ3746869
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
modellingconcurrencycomplexity boundsfairness constraintsfair termination problemprobabilistic concurrent finite-state programs
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)
Related Items (2)
Probabilistic Ianov's schemes ⋮ Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
This page was built for publication: