We study the model-checking problem for weighted timed automata and the weighted CTL logic by the bisimulation approach. Weighted timed automata are timed automata extended with co...
Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order log...
Although sorts and unary predicates are semantically identical in order-sorted logic, they are classified as different kinds of properties in formal ontology (e.g. sortal and non...
In this paper we discuss the question which properties of a formally verified component are preserved when the component is changed due to an adaption to a new use. More specific...
This paper describes various possible attacks on temporal properties such as temporal records of payment times and declarations of the closing times for electronic submissions, an...