Concurreny based transition refinement for the verification of distributed algorithms

We suggest a new notion of behaviour preserving transition refinement based on partial order semantics. This notion is called transition refinement. We introduced transition refinement for elementary (low-level) Petri Nets earlier. For modelling and verifying complex distributed algorithms, high-level (Algebraic) Petri nets are usually used. In this paper, we define transition refinement for Algebraic Petri Nets. This notion is more powerful than transition refinement for elementary Petri nets because it corresponds to the simultaneous refinement of several transitions in an elementary Petri net. Transition refinement is particularly suitable for refinement steps that increase the degree of distribution of an algorithm, e.g. when synchronous communication is replaced by asynchronous message passing. We study how to prove that a replacement of a transition is a transition refinement.

Ecotourism in China's Nature Reserves

This chapter provides an overview of ecotourism in China, including relevant policy, issues, and trends. Most concepts and definitions of ecotourism can be reduced to the following: ecotourism is tourism and recreation that is both nature based and sustainable. The focus of this chapter is on visitation at nature reserves in China. Issues relevant to sustainability and ecotourism objectives are noted in the chapter, and the need for ongoing development of policy and management systems is stressed in order to enhance future achievement of these objectives.