Titlebook: Refinement; Semantics, Languages John Derrick,Eerke Boiten Textbook 2018 Springer International Publishing AG, part of Springer Nature 2018

削木頭

書目名稱Refinement影響因子(影響力)




書目名稱Refinement影響因子(影響力)學(xué)科排名




書目名稱Refinement網(wǎng)絡(luò)公開度




書目名稱Refinement網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Refinement被引頻次




書目名稱Refinement被引頻次學(xué)科排名




書目名稱Refinement年度引用




書目名稱Refinement年度引用學(xué)科排名




書目名稱Refinement讀者反饋




書目名稱Refinement讀者反饋學(xué)科排名

預(yù)防注射

Diskectomy

Automata - Introducing Simulationsward and backward simulations. This causes us to consider the role of infinite behaviour in more depth. We discuss completeness results, that is whether the use of simulations is sufficient to verify a refinement. Finally, we introduce the important concept of bisimulation.

連接

excursion

A Relational View of Refinementused on simulations as a means to verify trace refinements in an Automata context, and we discussed both finite trace refinement as well as trace refinement in the presence of infinite traces. In Chap.?. we developed a basic refinement model that looked at states in the first place, and constructed

Presbycusis

Perspicuity, Divergence, and Internal Operationsividual transitions with the name of an operation, much as we had been doing in LTS and automata in Chaps.?. and ., and removed transitivity from the transition relation as we were now able to observe individual steps. We also created a separation between local (abstract) state and global (concrete)

dendrites

EXALT

范圍廣

Relational Concurrent Refinementstarts the task of relating these different refinement relations by defining corresponding processes for ADT specifications, as well as process semantics for ADT specifications, and providing theorems relating refinement relations across formalisms via such embeddings.

Ostrich