We study the problem of verifying role-based multi-agent systems, where the number of
components cannot be determined at design time. We give a semantics that captures …

GP (for Graph Programs) is an experimental nondeterministic programming language for
solving problems on graphs and graph-like structures. The language is based on graph …

While develo** concurrent systems, one of the important properties to be checked is
deadlock freedom. Model checking is an accurate technique to detect errors, such as …

Embedded real-time systems generate state sequences where time elapses between state
changes. Ensuring that such systems adhere to a provided specification of admissible or …

Software architectural style is one of the best concepts to define a family of related
architectures and their common properties. Despite the essential role of software …

Program logics typically reason about an over-approximation of program behaviour to prove
the absence of bugs. Recently, program logics have been proposed that instead prove the …

Various kinds of typed attributed graphs can be used to represent states of systems from a
broad range of domains. For dynamic systems, established formalisms such as graph …

Character recognition problems of distinct scripts have their own script specific
characteristics. The state-of-art optical character recognition systems use different …

We study parameterised verification of robot swarms against temporal-epistemic
specifications. We relax some of the significant restrictions assumed in the literature and …

GP 2 is an experimental nondeterministic programming language based on graph
transformation rules, allowing for visual programming and the solving of graph problems at a …