Using the tools of distinct excluded blocks, computational search and symbolic dynamics, the classification problem of all 256 elementary cellular automata is discussed from the point of view of time series generated ...Using the tools of distinct excluded blocks, computational search and symbolic dynamics, the classification problem of all 256 elementary cellular automata is discussed from the point of view of time series generated by them,and examples in each class are provided to explain the methods used.展开更多
In one-dimensional multiparticle Quantum Cellular Automaton (QCA), the approximation of the bosonic system by fermion (boson-fermion correspondence) can be derived in a rather simple and intriguing way, where the prin...In one-dimensional multiparticle Quantum Cellular Automaton (QCA), the approximation of the bosonic system by fermion (boson-fermion correspondence) can be derived in a rather simple and intriguing way, where the principle to impose zero-derivative boundary conditions of one-particle QCA is also analogously used in particle-exchange boundary conditions. As a clear cut demonstration of this approximation, we calculate the ground state of few-particle systems in a box using imaginary time evolution simulation in 2nd quantization form as well as in 1st quantization form. Moreover in this 2nd quantized form of QCA calculation, we use Time Evolving Block Decimation (TEBD) algorithm. We present this demonstration to emphasize that the TEBD is most natu-rally regarded as an approximation method to the 2nd quantized form of QCA.展开更多
Cellular Automaton （CA） based traffic flow models have been extensively studied due to their effectiveness and simplicity in recent years. This paper develops a discrete time Markov chain （DTMC） analytical framewo...Cellular Automaton （CA） based traffic flow models have been extensively studied due to their effectiveness and simplicity in recent years. This paper develops a discrete time Markov chain （DTMC） analytical framework for a Nagel-Schreckenberg and Fukui Ishibashi combined CA model （W^2H traffic flow model） from microscopic point of view to capture the macroscopic steady state speed distributions. The inter-vehicle spacing Maxkov chain and the steady state speed Markov chain are proved to be irreducible and ergodic. The theoretical speed probability distributions depending on the traffic density and stochastic delay probability are in good accordance with numerical simulations. The derived fundamental diagram of the average speed from theoretical speed distributions is equivalent to the results in the previous work.展开更多
模型检查是一种用于并发系统的性质验证的算法技术.LTLC(linear temporal logic with clocks)是一种连续时间时序逻辑,它是线性时序逻辑LTL的一种实时扩充.讨论实时系统关于LTLC公式的模型检查问题,将实时系统关于LTLC公式的模型检查化...模型检查是一种用于并发系统的性质验证的算法技术.LTLC(linear temporal logic with clocks)是一种连续时间时序逻辑,它是线性时序逻辑LTL的一种实时扩充.讨论实时系统关于LTLC公式的模型检查问题,将实时系统关于LTLC公式的模型检查化归为有穷状态转换系统关于LTL公式的模型检查,从而可以利用LTL的模型检查工具来对LTLC进行模型检查.由于LTLC既能表示实时系统的性质,又能表示实时系统的实现,这就使得时序逻辑LTLC的模型检查过程既能用于实时系统的性质验证,又能用于实时系统之间的一致性验证.展开更多
带抑制弧的时延着色Petri网(Timed Colored Petri Nets with Inhibitor Arcs,TCPNIA)是一种描述实时嵌入式系统的模型。给出了从TCPNIA到时间自动机的结构化转换算法,以利用变迁冲突调解机制保证TCPNIA模型和转换后的时间自动机模型语...带抑制弧的时延着色Petri网(Timed Colored Petri Nets with Inhibitor Arcs,TCPNIA)是一种描述实时嵌入式系统的模型。给出了从TCPNIA到时间自动机的结构化转换算法,以利用变迁冲突调解机制保证TCPNIA模型和转换后的时间自动机模型语义等价;并给出了语义等价的证明和算法复杂度分析。层次化方法被用来提高模型检测的时间与空间效率。通过实际案例展示了该技术的应用和可行性。展开更多
为了有效模拟室内空间行人流疏散状况,结合元胞蚁群算法和卡尔曼滤波提出了一种新的疏散模型(Pedestrian Evacuation based on Cellular Ant,PECA).该模型首先基于位置吸引力和出口拥挤度给出了行人移动概率的计算公式,同时定义演化过...为了有效模拟室内空间行人流疏散状况,结合元胞蚁群算法和卡尔曼滤波提出了一种新的疏散模型(Pedestrian Evacuation based on Cellular Ant,PECA).该模型首先基于位置吸引力和出口拥挤度给出了行人移动概率的计算公式,同时定义演化过程来阐述疏散策略,并利用元胞蚁群算法和卡尔曼滤波对最短疏散时间的优化模型进行求解.最后,利用建立的仿真平台进行实验,深入分析了疏散时间、出口宽度和初始行人密度之间的关系.结果表明,疏散时间与初始行人密度呈现正相关,而与出口宽度呈现负相关.与传统的元胞自动机疏散(Cellular Automaton,CA)模型相比,PECA的疏散效率更高.展开更多
文摘Using the tools of distinct excluded blocks, computational search and symbolic dynamics, the classification problem of all 256 elementary cellular automata is discussed from the point of view of time series generated by them,and examples in each class are provided to explain the methods used.
文摘In one-dimensional multiparticle Quantum Cellular Automaton (QCA), the approximation of the bosonic system by fermion (boson-fermion correspondence) can be derived in a rather simple and intriguing way, where the principle to impose zero-derivative boundary conditions of one-particle QCA is also analogously used in particle-exchange boundary conditions. As a clear cut demonstration of this approximation, we calculate the ground state of few-particle systems in a box using imaginary time evolution simulation in 2nd quantization form as well as in 1st quantization form. Moreover in this 2nd quantized form of QCA calculation, we use Time Evolving Block Decimation (TEBD) algorithm. We present this demonstration to emphasize that the TEBD is most natu-rally regarded as an approximation method to the 2nd quantized form of QCA.
基金supported by the National Basic Research Program of China (Grant No 2007CB310800)the National Natural Science Foundation of China (Grant Nos 60772150 and 60703018)the National High Technology Research and Development Program of China (Grant No 2008AA01Z208)
文摘Cellular Automaton （CA） based traffic flow models have been extensively studied due to their effectiveness and simplicity in recent years. This paper develops a discrete time Markov chain （DTMC） analytical framework for a Nagel-Schreckenberg and Fukui Ishibashi combined CA model （W^2H traffic flow model） from microscopic point of view to capture the macroscopic steady state speed distributions. The inter-vehicle spacing Maxkov chain and the steady state speed Markov chain are proved to be irreducible and ergodic. The theoretical speed probability distributions depending on the traffic density and stochastic delay probability are in good accordance with numerical simulations. The derived fundamental diagram of the average speed from theoretical speed distributions is equivalent to the results in the previous work.
文摘模型检查是一种用于并发系统的性质验证的算法技术.LTLC(linear temporal logic with clocks)是一种连续时间时序逻辑,它是线性时序逻辑LTL的一种实时扩充.讨论实时系统关于LTLC公式的模型检查问题,将实时系统关于LTLC公式的模型检查化归为有穷状态转换系统关于LTL公式的模型检查,从而可以利用LTL的模型检查工具来对LTLC进行模型检查.由于LTLC既能表示实时系统的性质,又能表示实时系统的实现,这就使得时序逻辑LTLC的模型检查过程既能用于实时系统的性质验证,又能用于实时系统之间的一致性验证.
文摘带抑制弧的时延着色Petri网(Timed Colored Petri Nets with Inhibitor Arcs,TCPNIA)是一种描述实时嵌入式系统的模型。给出了从TCPNIA到时间自动机的结构化转换算法,以利用变迁冲突调解机制保证TCPNIA模型和转换后的时间自动机模型语义等价;并给出了语义等价的证明和算法复杂度分析。层次化方法被用来提高模型检测的时间与空间效率。通过实际案例展示了该技术的应用和可行性。
文摘为了有效模拟室内空间行人流疏散状况,结合元胞蚁群算法和卡尔曼滤波提出了一种新的疏散模型(Pedestrian Evacuation based on Cellular Ant,PECA).该模型首先基于位置吸引力和出口拥挤度给出了行人移动概率的计算公式,同时定义演化过程来阐述疏散策略,并利用元胞蚁群算法和卡尔曼滤波对最短疏散时间的优化模型进行求解.最后,利用建立的仿真平台进行实验,深入分析了疏散时间、出口宽度和初始行人密度之间的关系.结果表明,疏散时间与初始行人密度呈现正相关,而与出口宽度呈现负相关.与传统的元胞自动机疏散(Cellular Automaton,CA)模型相比,PECA的疏散效率更高.
