scientific article
From MaRDI portal
Publication:3947096
zbMath0486.68009MaRDI QIDQ3947096
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
operational semanticspowerdomainscall-by-valuecall-time choicecomputable elementsfully-abstract modelsnondeterministic evaluationoperational preorders between programsrun- time choice
Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)
Related Items
Infinite streams and finite observations in the semantics of uniform concurrency ⋮ Rewriting with a nondeterministic choice operator ⋮ Testing equivalences for processes ⋮ Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus ⋮ Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes ⋮ Dual unbounded nondeterminacy, recursion, and fixpoints ⋮ Remarks on Testing Probabilistic Processes
