作者: Carlo A. Furia , Dino Mandrioli , Angelo Morzenti , Matteo Rossi
DOI: 10.1007/978-3-642-32332-4_7
关键词: Automaton 、 Semantics (computer science) 、 State (computer science) 、 Theoretical computer science 、 Abstract machine 、 Model checking 、 Discrete time and continuous time 、 Transition system 、 Rotation formalisms in three dimensions 、 Computer science
摘要: In this chapter, we analyze state-based formalisms that extend the basic automata models of Chap. 6 with a notion time. The discussion progresses from simplest to richer and extensions can express sophisticated timing properties. First, introduce transition system, which is used provide semantics discussed in rest chapter later ones. Then, show how finite-state represent temporal features systems. We then discuss several classic model automata: Timed Transition Models Statecharts specific mechanisms for modeling discrete time, while timed hybrid include deal continuous shows probabilities be introduced automata; it concludes some design verification techniques tools based on presented earlier.