状态机器的英文

• machine state
• state machine

• "状态"英文翻译    status; state; condition; st ...
• "机器"英文翻译    machine; machinery; engine
• "判优状态机器" 英文翻译 :    arbitration state machine; machine, arbitration state
• "写入状态机器" 英文翻译 :    machine, write-state (wsm); write-state machine
• "异步状态机器" 英文翻译 :    asynchronous state machine; machine, asynchronous state
• "有限状态机器" 英文翻译 :    finite state machine
• "状态机器编译程序" 英文翻译 :    state-machine compiler
• "状态机" 英文翻译 :    finite state machines; fsm; state machine
• "有限态机器" 英文翻译 :    finite state machine
• "事务状态机" 英文翻译 :    tsm transaction state machine
• "算法状态机" 英文翻译 :    algorithmic state machine
• "协议状态机" 英文翻译 :    protocol state machine
• "行为状态机" 英文翻译 :    behavioral state machine
• "有限状态机" 英文翻译 :    finite automaton; finite state machine fsm; finite-state machine; fsm finite state machine; ingems
• "状态机视图" 英文翻译 :    state machine view
• "状态机图" 英文翻译 :    state machine diagram
• "子状态机状态" 英文翻译 :    submachine state
• "moore有限状态机" 英文翻译 :    moore machine
• "证书状态机构" 英文翻译 :    certificate status authority
• "子状态机引用状态" 英文翻译 :    submachine reference state
• "确定性有限态机器" 英文翻译 :    deterministic finite state machine
• "光洁状态机动速度" 英文翻译 :    flap-umaneuvering speed
• "过渡状态机动动作" 英文翻译 :    transition maneuver
• "决定型有限状态机" 英文翻译 :    deterministic finite state automaton
• "通信有限状态机" 英文翻译 :    communicating finite state machine

• Kuiper originally used cwmtx to simulate systems built from discrete and interactive state machines
  Kuiper原先用cwmtx来模拟用离散的交互式状态机器构建的系统。
• Loosely speaking , model checking is a way to check for the existence of a finite state machine ( specification ) in another finite state machine ( program )
  不严格地说，模型检查是在一个有限状态机器（程序）中检验另一个有限状态机器（清单）存在性的一个方法。
• The program being checked is also converted to a finite state machine , created by abstracting away all the details except the atomic predicates observed in the program
  被检查的程序也被转换为一个有限状态机器，通过摘掉所有细节、只保留程序中被观测的原子谓词。
• The property to be checked is described as a finite state machine that transitions on atomic predicates , properties that can be identified by cursory look at the program
  所要检查的特性被描述为一个有限状态机器，即原子谓词上的转变，这样粗略地查看程序就能识别出这些特性。
• The graph can be seen as a state machine . although , the executional model that we will explain here is concrete and has better support for concurrent paths of execution
  这个图表可以看做是一个状态机器。虽然我们这里解释的执行模式是具体的且更好的为并发路径执行提供更好的支持。
• If wep is not involved , it effectively exploits the so - called race conditions between the 802 . 1x and 802 . 11 state machines , in which a thief who wants to steal the session is racing the owner to the access point " door . " if he wins , he owns everything
  如果没有wep ，它会有效地利用802 . 1x和802 . 11状态机器之间所谓的竞争条件，这样想窃取会话的小偷就在与会话所有者竞争接入点“门” 。如果他赢了，那么他就拥有了一切。