Stronger reduction criteria for Local First Search

Autor: Kurban, M.E., Niebert, Peter, Qu, Hongyang, Vogler, Walter, Barkaoui, Kamel, Cavalcanti, Ana, Cerone, Antonio

Publikováno v: Proceedings of the Third International Colloquium on Theoretical Aspects of Computing, 108-122
STARTPAGE=108;ENDPAGE=122;TITLE=Proceedings of the Third International Colloquium on Theoretical Aspects of Computing
Lecture Notes in Computer Science ISBN: 9783540488156
ICTAC

Local First Search (LFS) is a partial order technique for reducing the number of states to be explored when trying to decide reachability of a local (component) property in a parallel system; it is based on an analysis of the structure of the partial

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f24d58e271d1f7eab689d6014f893cf8
https://doi.org/10.1007/11921240_8

Graph Abstraction for a Modal Logic

Autor: Boneva, Iovka, Ehrig, H, Kreiker, Jörg, Kurban, M.E., Rensink, Arend

Publikováno v: Bulletin of the European Association for Theoretical Computer Science, 97, 106-116. European Association for Theoretical Computer Science

We are studying a particular graph abstraction, based on the concept of retaining neighbourhood information up to a certain radius for each node. In this contribution, we present a modal logic on graphs that is preserved and reflected by this abstrac

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::000c1eea27c7238ff78991c6d5b5d616
https://research.utwente.nl/en/publications/graph-abstraction-for-a-modal-logic(f72316b7-bc04-4c32-ab72-7ac1c2606551).html

Graph Abstraction and Abstract Graph Transformation

Autor: Boneva, I.B., Rensink, Arend, Kurban, M.E., Bauer, J.

Many important systems like concurrent heap-manipulating programs, communication networks, or distributed algorithms are hard to verify due to their inherent dynamics and unboundedness. Graphs are an intuitive representation of states of these system

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::3560a2db28d3819469ca7c94f0de1428
https://research.utwente.nl/en/publications/graph-abstraction-and-abstract-graph-transformation(d0bbd28b-c914-4d12-aeb6-6f9cc98d21f8).html