| 周期性可定实时并行进程的进化代数分析 |
| |
| 引用本文： | 梁平. 周期性可定实时并行进程的进化代数分析[J]. 数字社区&智能家居, 2006, 0(2) |
| |
| 作者姓名： | 梁平 |
| |
| 作者单位： | 西南民族大学计算机科学学院 四川成都610041 |
| |
| 摘 要： | 对应用进化代数(EA),即目前的抽象状态机(AbstractStateMachine–ASM),描述可定时实时并行进程进行了研究,进化代数采用第一顺序逻辑(First-OrderLogic)定义或解释计算机问题,描述不同的抽象等级并且逻辑地描述计算机算法,因此非常适合描述并行进程复杂的运行过程,并逻辑地精确推导进程调度。
|
| 关 键 词： | 进化代数(EA或ASM) 非正式语义 第一顺序逻辑(FOL) 实时并行进程 |
Evolving Algebra for Periodic Deterministic Real- Time Concurrency |
| |
| LIANG Ping. Evolving Algebra for Periodic Deterministic Real- Time Concurrency[J]. Digital Community & Smart Home, 2006, 0(2) |
| |
| Authors: | LIANG Ping |
| |
| Abstract: | The research is to use Evolving Algebra(ASM) to specify the processes of periodic real- time concurrency. EA specifies computa- tional problems by informal semantics with first- order logic, which is applicable in many computing situations. The informal semantics can be described in different abstraction level and logically specify computation problems. Therefore it is very suitable to describe complicated concur- rent processes and logically and precisely induce process scheduling. |
| |
| Keywords: | Evolving algebra informal semantics first- order logic(FOL) real time concurrency |
| 本文献已被 CNKI 等数据库收录！ |
