کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10328894 | 685218 | 2005 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Characteristic μ-Calculus Formulas for Underspecified Transition Systems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
Underspecification, which is essential for specification formalisms, is usually expressed by equivalences, simulations, or logic approaches. We introduce underspecified transition systems (UTSs) as general model general model for underspecification, where, e.g., transitions point to sets of states. We argue for the generality of the UTSs by showing that the class of all UTSs is strictly more expressive than the standard equivalences and simulation approaches, in the sense that more sets of transition systems can be expressed. Additionally, a characteristic formula in terms of the μ-calculus is presented for every finite state UTS. Furthermore, we show that UTSs can finitely describe sets of transition systems, whenever they can be described finitely by the other standard approaches except for trace-set extension or μ-calculus descriptions.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Theoretical Computer Science - Volume 128, Issue 2, 14 April 2005, Pages 103-116
Journal: Electronic Notes in Theoretical Computer Science - Volume 128, Issue 2, 14 April 2005, Pages 103-116
نویسندگان
Harald Fecher, Martin Steffen,