Fair testing
type: Item
instance of: scholarly article
title: Fair testing
zbMATH Open document ID: 1109.68077
author: Arend Rensink
author: Walter Vogler
published in: Information and Computation
publication date: 2007-02-20T00:00:00Z
full work available at URL: fair-testing(2416eb87-7061-40ea-9764-67b1e7a7c292).html
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68M15
zbMATH DE Number: 5128339
zbMATH Keywords: fairness
zbMATH Keywords: testing theory
zbMATH Keywords: coarsest congruence
zbMATH Keywords: process algebra
describes a project that uses: LOTOS
MaRDI profile type: Publication
OpenAlex ID: W2913931721
cites work: Process Algebra
cites work: Q3727367
cites work: Structural operational semantics for weak bisimulations
cites work: Bisimulation can't be traced
cites work: Basic observables for processes
cites work: Q5137878
cites work: CONCUR '95: Concurrency theory. 6th international conference, Philadelphia, PA, USA, August 21--24, 1995. Proceedings
cites work: A Theory of Communicating Sequential Processes
cites work: Q3680258
cites work: Testing preorders for probabilistic processes.
cites work: Testing equivalence as a bisimulation equivalence
cites work: Testing equivalences for processes
cites work: Higher-level synchronising devices in Meije-SCCS
cites work: On the operational semantics of nondeterminism and divergence
cites work: A hierarchy of equivalences for asynchronous calculi
cites work: Q3777424
cites work: Probabilistic extensions of process algebras.
cites work: Q3765231
cites work: A calculus of communicating systems
cites work: Calculi for synchrony and asynchrony
cites work: Q3992568
cites work: Barbed bisimulation
cites work: Foundations of software technology and theoretical computer science. 18th conference, Chennai, India, December 17--19, 1998. Proceedings
cites work: Automata, languages and programming. 22nd international colloquium, ICALP '95, Szeged, Hungary, July 10--14, 1995. Proceedings
cites work: Q3907077
cites work: Compositional failure-based semantic models for basic LOTOS
cites work: The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
cites work: Failures semantics and deadlocking of modular Petri nets
cites work: Modular construction and partial order semantics of Petri nets
cites work: Impossible futures and determinism
DOI: 10.1016/J.IC.2006.06.002
description: scientific article; zbMATH DE number 5128339