Fair testing

DOI10.1016/j.ic.2006.06.002zbMath1109.68077OpenAlexW2913931721MaRDI QIDQ865623

Walter Vogler, Arend Rensink

Publication date: 20 February 2007

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/fair-testing(2416eb87-7061-40ea-9764-67b1e7a7c292).html

zbMATH Keywords

fairnessprocess algebratesting theorycoarsest congruence

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (27)

On projecting processes into session types ⋮ Inference Systems with Corules for Combined Safety and Liveness Properties of Binary Session Types ⋮ Compliance in Behavioural Contracts: A Brief Survey ⋮ Conflict-preserving abstraction of discrete event systems using annotated automata ⋮ All congruences below stability-preserving fair testing or CFFD ⋮ Synthesising correct concurrent runtime monitors ⋮ Undecidability of accordance for open systems with unbounded message queues ⋮ Keep it fair: equivalence and composition ⋮ Probabilistic may/must testing: retaining probabilities by restricted schedulers ⋮ Observing Success in the Pi-Calculus ⋮ Structural Rewriting in the pi-Calculus. ⋮ Trace- and failure-based semantics for responsiveness ⋮ Fair refinement for asynchronous session types ⋮ Process calculi as a tool for studying coordination, contracts and session types ⋮ On generic context lemmas for higher-order calculi with sharing ⋮ Sub-behaviour relations for session-based client/server systems ⋮ Fair subtyping for multi-party session types ⋮ Modelling session types using contracts ⋮ Relating fair testing and accordance for service replaceability ⋮ A precongruence format for should testing preorder ⋮ On Finite Bases for Weak Semantics: Failures Versus Impossible Futures ⋮ Closures of may-, should- and must-convergences for contextual equivalence ⋮ A fixed-points based framework for compliance of behavioural contracts ⋮ Equations, Contractions, and Unique Solutions ⋮ A theory of contracts for strong service compliance ⋮ Stubborn Sets, Frozen Actions, and Fair Testing ⋮ On constructibility and unconstructibility of LTS operators from other LTS operators

Uses Software

• LOTOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modular construction and partial order semantics of Petri nets
• Structural operational semantics for weak bisimulations
• Calculi for synchrony and asynchrony
• Higher-level synchronising devices in Meije-SCCS
• Failures semantics and deadlocking of modular Petri nets
• A calculus of communicating systems
• Foundations of software technology and theoretical computer science. 18th conference, Chennai, India, December 17--19, 1998. Proceedings
• Basic observables for processes
• Testing equivalences for processes
• On the operational semantics of nondeterminism and divergence
• Impossible futures and determinism
• A hierarchy of equivalences for asynchronous calculi
• Testing preorders for probabilistic processes.
• Automata, languages and programming. 22nd international colloquium, ICALP '95, Szeged, Hungary, July 10--14, 1995. Proceedings
• CONCUR '95: Concurrency theory. 6th international conference, Philadelphia, PA, USA, August 21--24, 1995. Proceedings
• Compositional failure-based semantic models for basic LOTOS
• Testing equivalence as a bisimulation equivalence
• A Theory of Communicating Sequential Processes
• Process Algebra
• Bisimulation can't be traced
• Barbed bisimulation

This page was built for publication: Fair testing