A parallel embedding overlapped iterative (EOI) algorithm about classicimplicit equations with asymmetric Saul'yev schemes (CIS-EOI) to solve one-dimensional diffusionequations is discussed to improve the properti...A parallel embedding overlapped iterative (EOI) algorithm about classicimplicit equations with asymmetric Saul'yev schemes (CIS-EOI) to solve one-dimensional diffusionequations is discussed to improve the properties of the segment classic implicit iterative (SCII)algorithm. The structure of CIS-EOI method is given and the stability of scheme and convergence ofiteration are proved by matrix method. The property of gradual-approach convergence is alsodiscussed. It has been shown that the convergent rate is faster and the property of gradual-approachconvergence also becomes better with the increasing of the net point in subsystems than with theSCII algorithm. The simulation examples show that the parallel iterative algorithm with a differentinsertion scheme CIS-EOI is more effective.展开更多
This paper proposes a formal method which is used to model and analyze network devices such as touters. It is based on an algebraic process called “ACSR-VP”, which enhances the original CCS algebraic process by inco...This paper proposes a formal method which is used to model and analyze network devices such as touters. It is based on an algebraic process called “ACSR-VP”, which enhances the original CCS algebraic process by incorporating the notions of time, resource requirements, dynamic prioritization, and synchronization. Therefore, although there are many formal methods to analyze the timed concurrency system, ACSR-VP, due to its prominent features, is best fit for analysis of a resource bounded real-time system. This paper extends ACSR-VP to EACSR-VP, which is more adaptive to the features of network devices and specializes in analyzing this kind of embedded system. EACSR-VP adds the notion of n-way communication which allows more than two processes to participate in synchronization. It also enhances value-passing capabilities which make for more flexible specifications. Finally, specifications, verification and analysis methods with EACSR-VP are introduced by a case study of router with multiple input queues.展开更多
文摘A parallel embedding overlapped iterative (EOI) algorithm about classicimplicit equations with asymmetric Saul'yev schemes (CIS-EOI) to solve one-dimensional diffusionequations is discussed to improve the properties of the segment classic implicit iterative (SCII)algorithm. The structure of CIS-EOI method is given and the stability of scheme and convergence ofiteration are proved by matrix method. The property of gradual-approach convergence is alsodiscussed. It has been shown that the convergent rate is faster and the property of gradual-approachconvergence also becomes better with the increasing of the net point in subsystems than with theSCII algorithm. The simulation examples show that the parallel iterative algorithm with a differentinsertion scheme CIS-EOI is more effective.
文摘This paper proposes a formal method which is used to model and analyze network devices such as touters. It is based on an algebraic process called “ACSR-VP”, which enhances the original CCS algebraic process by incorporating the notions of time, resource requirements, dynamic prioritization, and synchronization. Therefore, although there are many formal methods to analyze the timed concurrency system, ACSR-VP, due to its prominent features, is best fit for analysis of a resource bounded real-time system. This paper extends ACSR-VP to EACSR-VP, which is more adaptive to the features of network devices and specializes in analyzing this kind of embedded system. EACSR-VP adds the notion of n-way communication which allows more than two processes to participate in synchronization. It also enhances value-passing capabilities which make for more flexible specifications. Finally, specifications, verification and analysis methods with EACSR-VP are introduced by a case study of router with multiple input queues.
