Conformance checking of a component is a testing method to see if an implementation and its executable specification are behaviorally equivalent relative to any interactions performed on the implementation. Such checking is complicated by the presence of non-determinism in the specification: the specification may permit a set of possible behaviors. We present a new method to automatically deriv...

Trace semantics has been defined for various non-deterministic systems with different input/output types, or with different types of “non-determinism” such as classical non-determinism (with a set of possible choices) vs. probabilistic nondeterminism. In this paper we claim that these various forms of “trace semantics” are instances of a single categorical construction, namely coinduction in a ...

Watson-Crick (WK) finite automata are working on a tape, that is, DNA molecule. A double stranded molecule contains two strands, each having 5' and 3' end, these strands together form the with following properties. The have same length, their to directions opposite, in position, nucleotides complement of other (by complementary relation). Consequently, WK reading heads, one for strand. In tradi...

Reproducibility is an essential component of the scientific process. Including software and data with a published paper is a good step towards reproducible research. However, the presence of non-determinism in a scientific workflow can make validating results very difficult even between two runs on the same machine, the same day, and using the exact same command and parameters. But for reproduc...

We present a model of automaton for picture language recognition, called Wang automaton, which is based on labeled Wang tiles. Wang automata combine features of both online tessellation acceptors and 4-way automata: as in online tessellation acceptors, computation assigns states to each picture position; as in 4-way automata, the input head visits the picture moving from one pixel to an adjacen...

Determinism is a powerful property, making it much easier to design, implement, and debug parallel programs when it can be guaranteed. There has been much work on guaranteeing determinism of programs, both through dynamic and static approaches. The dynamic approaches tend to have high overheads, while the static approaches can be difficult for non-experts to understand and can require high prog...

determinism  and debility (wahn) reputation to preceding lawyers hossein bahrami aghdam [1]   abstract determinism and traditional documentary-brokerage debility (wahn) currently signify a special attribute, and in inference it is unique. however, the attitudes of ancients themselves concerning that attribute and evaluation of its reliablity was determinant. in research and re-reading of works ...

In this paper we propose a stochastic broadcast π-calculus which can be used to model server-client based systems where synchronization is always governed by only one participant. Therefore, there is no need to determine the joint synchronization rates. We also take immediate transitions into account which is useful to model behaviors with no impact on the temporal properties of a system. Since...