کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4951407 | 1441451 | 2017 | 25 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Solving computational tasks on finite topologies by means of relation algebra and the RelView tool
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Solving computational tasks on finite topologies by means of relation algebra and the RelView tool Solving computational tasks on finite topologies by means of relation algebra and the RelView tool](/preview/png/4951407.png)
چکیده انگلیسی
We present a relation-algebraic approach to solve computational tasks concerning finite topologies. It is based on the modeling of finite topologies via relations and the specification of the notions in question by relation-algebraic expressions and formulae. The latter then are evaluated with the help of the BDD-based specific purpose computer algebra system RelView after a simple translation into the system's programming language. We apply the technique to different problems and show how the solutions behave with regard to running time if implemented and evaluated by RelView. Experiments with RelView led to a new result on minimal subbases for finite topologies, that is proved at the end of the paper.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Logical and Algebraic Methods in Programming - Volume 88, April 2017, Pages 1-25
Journal: Journal of Logical and Algebraic Methods in Programming - Volume 88, April 2017, Pages 1-25
نویسندگان
Rudolf Berghammer, Michael Winter,