کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10328888 | 685218 | 2005 | 30 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On the Expressiveness of Higher Dimensional Automata
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: On the Expressiveness of Higher Dimensional Automata On the Expressiveness of Higher Dimensional Automata](/preview/png/10328888.png)
چکیده انگلیسی
I also extend various equivalence relations for concurrent systems to higher dimensional automata. These include the history preserving bisimulation, which is the coarsest equivalence that fully respects branching time, causality and their interplay, as well as the ST-bisimulation, a branching time respecting equivalence that takes causality into account to the extent that it is expressible by actions overlapping in time. Through their embeddings in higher dimensional automata, it is now well-defined whether members of different models of concurrency are equivalent.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Theoretical Computer Science - Volume 128, Issue 2, 14 April 2005, Pages 5-34
Journal: Electronic Notes in Theoretical Computer Science - Volume 128, Issue 2, 14 April 2005, Pages 5-34
نویسندگان
R.J. van Glabbeek,