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)
Recommendations
Cites work
- scientific article; zbMATH DE number 3902016 (Why is no real title available?)
- scientific article; zbMATH DE number 3958712 (Why is no real title available?)
- scientific article; zbMATH DE number 4022620 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- A Theory of Communicating Sequential Processes
- A calculus of communicating systems
- A hierarchy of equivalences for asynchronous calculi
- Automata, languages and programming. 22nd international colloquium, ICALP '95, Szeged, Hungary, July 10--14, 1995. Proceedings
- Barbed bisimulation
- Basic observables for processes
- Bisimulation can't be traced
- CONCUR '95: Concurrency theory. 6th international conference, Philadelphia, PA, USA, August 21--24, 1995. Proceedings
- Cache consistency by design
- Calculi for synchrony and asynchrony
- 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
- Higher-level synchronising devices in Meije-SCCS
- Impossible futures and determinism
- Modular construction and partial order semantics of Petri nets
- On the operational semantics of nondeterminism and divergence
- Probabilistic extensions of process algebras.
- Process Algebra
- Structural operational semantics for weak bisimulations
- Testing equivalence as a bisimulation equivalence
- Testing equivalences for processes
- Testing preorders for probabilistic processes.
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
Cited in
(33)- Trace- and failure-based semantics for responsiveness
- Modelling session types using contracts
- Fair must testing for I/O automata
- Sub-behaviour relations for session-based client/server systems
- Fair refinement for asynchronous session types
- Fair subtyping for multi-party session types
- Synthesising correct concurrent runtime monitors
- Stubborn Sets, Frozen Actions, and Fair Testing
- A fixed-points based framework for compliance of behavioural contracts
- Probabilistic may/must testing: retaining probabilities by restricted schedulers
- On projecting processes into session types
- Minimal translations from synchronous communication to synchronizing locks
- Equations, contractions, and unique solutions
- Inference Systems with Corules for Combined Safety and Liveness Properties of Binary Session Types
- Compliance in behavioural contracts: a brief survey
- The coarsest precongruences respecting safety and liveness properties
- On constructibility and unconstructibility of LTS operators from other LTS operators
- Process calculi as a tool for studying coordination, contracts and session types
- Undecidability of accordance for open systems with unbounded message queues
- A precongruence format for should testing preorder
- Conflict-preserving abstraction of discrete event systems using annotated automata
- Automated Technology for Verification and Analysis
- Keep it fair: equivalence and composition
- Relating fair testing and accordance for service replaceability
- Observing Success in the Pi-Calculus
- A theory of contracts for strong service compliance
- On generic context lemmas for higher-order calculi with sharing
- Fair asynchronous session subtyping
- Fair student placement
- Closures of may-, should- and must-convergences for contextual equivalence
- Structural Rewriting in the pi-Calculus.
- All congruences below stability-preserving fair testing or CFFD
- On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
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)
