Automata-theoretic verification of systems

更新时间:2023-07-23 06:27:45 阅读: 评论:0

英文儿歌
专利名称:Automata-theoretic verification of systems 发明人:HARDIN RONALD H.,KURSHAN ROBERT PAUL
reading>myname
申请号:US94647397
申请日:19971007e you again什么意思
公开号:US6185516B1
琥珀教育公开日:
tuko
坚持就是胜利英语
framerelay20010206
急冻人
专利内容由知识产权出版社提供小学生英语
摘要:Verification systems which employ automata-theoretic formal verification u a model automaton made from a system process (203) reprenting the system and a task automaton (205) reprenting the task and u the model automaton to test (217) whether the language of the system process is contained in the language of the task automaton. An improved technique reduces the computational complexity of the language containment testing by producing a model (216) which reprents a system which has been automatically localized with regard to a task. Another technique reduces the computational complexity of stepwi refinement (208). In stepwi refinement, the system automaton is refined a step at a time until it reaches the complexity of a practical implementation. The computational complexity of the stepwi refinement is reduced by a technique which permits language containment to be tested using a t of models made from process-automaton pairs rather than process-process pairs.
申请人:LUCENT TECHNOLOGIES INC.
更多信息请下载全文后查看

本文发布于:2023-07-23 06:27:45,感谢您对本站的认可!

本文链接:https://www.wtabcd.cn/fanwen/fan/78/1112257.html

版权声明:本站内容均来自互联网,仅供演示用,请勿用于商业和其他非法用途。如果侵犯了您的权益请与我们联系,我们将在24小时内删除。

标签:专利   全文   下载   知识产权
相关文章
留言与评论(共有 0 条评论)
   
验证码:
推荐文章
排行榜
Copyright ©2019-2022 Comsenz Inc.Powered by © 专利检索| 网站地图