Approximate Completed Trace Equivalence of Linear Algebra Transition Systems.

BIC-TA(2013)

引用 2|浏览8
暂无评分
摘要
We proposed the approximate completed trace equivalence of Linear Algebra Transition Systems(LATS); it is inefficient to eliminate states. We use linear polynomial programs to describe system actions, and then the completed trace equivalence of inhomogeneous linear transition systems is established. Subsequently, it proposed the theory and algorithm of approximate completed trace equivalence of linear algebra transition systems. © Springer-Verlag Berlin Heidelberg 2013.
更多
查看译文
关键词
approximate completed trace equivalence,linear algebra transition systems,linear polynomial programs
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要