Removing redundant refusals: minimal complete test suites for failure trace semantics

DOI10.1016/j.ic.2023.105009zbMath1506.68059OpenAlexW4318035568MaRDI QIDQ2687991

Maciej Gazda, Robert M. Hierons

Publication date: 7 March 2023

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

Full work available at URL: https://doi.org/10.1016/j.ic.2023.105009

zbMATH Keywords

characteristic formulaeprocess semanticscomplete test suiterefusal trace semantics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Testing using CSP Models: Time, Inputs, and Outputs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Refusal testing
• Characteristic formulae for processes with divergence
• Interval stability and interval covering property in finite posets
• Fundamental approaches to software engineering. 16th international conference, FASE 2013, held as part of the European joint conferences on theory and practice of software, ETAPS 2013, Rome, Italy, March 16--24, 2013. Proceedings
• Understanding concurrent systems
• When are prime formulae characteristic?
• Characteristic formulae for fixed-point semantics: a general framework
• On minimizing the lengths of checking sequences
• A modal characterization of observational congruence on finite terms of CCS
• Testing can be formal, too
• Inputs and Outputs in CSP
• Testing finite-state machines: state identification and verification

This page was built for publication: Removing redundant refusals: minimal complete test suites for failure trace semantics