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

削木头

书目名称Refinement影响因子(影响力)




书目名称Refinement影响因子(影响力)学科排名




书目名称Refinement网络公开度




书目名称Refinement网络公开度学科排名




书目名称Refinement被引频次




书目名称Refinement被引频次学科排名




书目名称Refinement年度引用




书目名称Refinement年度引用学科排名




书目名称Refinement读者反馈




书目名称Refinement读者反馈学科排名

预防注射

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