A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
This paper presents a new approach to modelling and verification of function block applications of the IEC 61499 standard. The approach uses the language of logic programming Prol...
Victor Dubinin, Valeriy Vyatkin, Hans-Michael Hani...
We present a method for trust scenarios with more than one trustee, where sets of trustees are ordered in a relation of relative trustworthiness. We show how a priority structure i...
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
LMNtal (pronounced “elemental”) is a simple language model based on graph rewriting that uses logical variables to represent links and membranes to represent hierarchies. The ...