Conformance testing with the guaranteed fault coverage is based on distinguishing faulty system implementations from the corresponding system specification. We consider timed systems modeled by timed possibly nondeterministic finite state machines (TFSMs) and propose algorithms for distinguishing two TFSMs. In particular, we present a preset algorithm for separating two separable TFSMs and an a...

A distinguishing colouring of a graph is a colouring of the vertex set such that no non-trivial automorphism preserves the colouring. Tucker conjectured that if every non-trivial automorphism of a locally finite graph moves infinitely many vertices, then there is a distinguishing 2-colouring. We show that the requirement of local finiteness is necessary by giving a nonlocally finite graph for w...

An undirected graph G is said to be d-distinguishable if there is a d-coloring of its vertex set V (G) such that no nontrivial automorphism of G preserves the coloring. The distinguishing number of a graph G is the minimum d for which it is d-distinguishable. In this paper we design efficient algorithms for computing the distinguishing numbers of trees and planar graphs.

The energy change per electron in a chemical or physical transformation, ΔE/n, may be expressed as Δχ̅ + Δ(VNN + ω)/n, where Δχ̅ is the average electron binding energy, a generalized electronegativity, ΔVNN is the change in nuclear repulsions, and Δω is the change in multielectron interactions in the process considered. The last term can be obtained by the difference from experimental or theoreti...

Article 4 7(1) of Law No 23 2006 on the Administration Population (Adminduk) provides that adoption children is a legal act to transfer rights child from families parents, guardians and others responsible for care, education bringing into their adoptive parents by decision Court Basing this acceptance concept or limitation with certain law-controlled goals aims inevitable consequences, such as ...

The distinguishing number of a group A acting faithfully on a set X, denoted D(A,X), is the least number of colors needed to color the elements of X so that no nonidentity element of A preserves the coloring. Given a map M (an embedding of a graph in a closed surface) with vertex set V and without loops or multiples edges, let D(M) = D(Aut(M), V ), where Aut(M) is the automorphism group of M ; ...