Communication and Concurrency
Refusal Testing for Classes of Transition Systems with Inputs and Outputs
FORTE X / PSTV XVII '97 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE X) and Protocol Specification, Testing and Verification (PSTV XVII)
The Linear Time-Branching Time Spectrum (Extended Abstract)
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
A Modal Characterisation of Observable Machine-Behaviour
CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
Formalization of test experiments
Programming and Computing Software
Testing transition systems with input and output testers
TestCom'03 Proceedings of the 15th IFIP international conference on Testing of communicating systems
Interaction semantics with refusals, divergence, and destruction
Programming and Computing Software
Hi-index | 0.00 |
An approach to modeling the components of distributed systems whose interaction is based on handling events with regard for their priorities is considered. Although the priority-based servicing of requests or messages is widely used in practice, the mathematical models of the interaction of such programs often neglect the priorities thus introducing extra nondeterminism in the description of their behavior. The proposed approach attempts to avoid this drawback by defining the parallel composition that provides a model for the interaction of this kind. The subject matter of this paper is the development of a formal theory of testing the components that use priorities. Within this theory, the concept of a safe execution of the model and the conformance relation between the models are introduced, and the generation of test suites that check conformity is considered.