Fair testing
DOI10.1016/J.IC.2006.06.002zbMATH Open1109.68077OpenAlexW2913931721MaRDI QIDQ865623FDOQ865623
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
Recommendations
Reliability, testing and fault tolerance of networks and computer systems (68M15) Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Higher-level synchronising devices in Meije-SCCS
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bisimulation can't be traced
- Structural operational semantics for weak bisimulations
- Calculi for synchrony and asynchrony
- A calculus of communicating systems
- Testing equivalences for processes
- A Theory of Communicating Sequential Processes
- Process Algebra
- Barbed bisimulation
- Testing preorders for probabilistic processes.
- Testing equivalence as a bisimulation equivalence
- Modular construction and partial order semantics of Petri nets
- Probabilistic extensions of process algebras.
- Title not available (Why is that?)
- A hierarchy of equivalences for asynchronous calculi
- Basic observables for processes
- Impossible futures and determinism
- Compositional failure-based semantic models for basic LOTOS
- Failures semantics and deadlocking of modular Petri nets
- Foundations of software technology and theoretical computer science. 18th conference, Chennai, India, December 17--19, 1998. Proceedings
- On the operational semantics of nondeterminism and divergence
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (31)
- Process calculi as a tool for studying coordination, contracts and session types
- Undecidability of accordance for open systems with unbounded message queues
- Trace- and failure-based semantics for responsiveness
- On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
- Probabilistic may/must testing: retaining probabilities by restricted schedulers
- A precongruence format for should testing preorder
- Relating fair testing and accordance for service replaceability
- Fair student placement
- Fair refinement for asynchronous session types
- Stubborn Sets, Frozen Actions, and Fair Testing
- Closures of may-, should- and must-convergences for contextual equivalence
- Keep it fair: equivalence and composition
- Compliance in Behavioural Contracts: A Brief Survey
- A theory of contracts for strong service compliance
- A fixed-points based framework for compliance of behavioural contracts
- Synthesising correct concurrent runtime monitors
- Modelling session types using contracts
- Sub-behaviour relations for session-based client/server systems
- Observing Success in the Pi-Calculus
- Fair asynchronous session subtyping
- Equations, Contractions, and Unique Solutions
- Inference Systems with Corules for Combined Safety and Liveness Properties of Binary Session Types
- On projecting processes into session types
- Minimal translations from synchronous communication to synchronizing locks
- Conflict-preserving abstraction of discrete event systems using annotated automata
- Structural Rewriting in the pi-Calculus.
- All congruences below stability-preserving fair testing or CFFD
- Fair subtyping for multi-party session types
- On constructibility and unconstructibility of LTS operators from other LTS operators
- On generic context lemmas for higher-order calculi with sharing
- Automated Technology for Verification and Analysis
Uses Software
This page was built for publication: Fair testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q865623)
