Asynchronous cellular automata for pomsets-Reference-Cited by-同舟云学术

Asynchronous cellular automata for pomsets

Published:2000-09 Issue:1-2 Volume:247 Page:1-38
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Droste Manfred,Gastin Paul,Kuske Dietrich

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference21 articles.

1. An extension of the notions of traces and of asynchronous automata;Arnold;Inform. Théorique Appl.,1991

2. Asynchronous mappings and asynchronous cellular automata;Cori;Inform. and Comput.,1993

3. M. Droste, P. Gastin, Asynchronous cellular automata for pomsets without autoconcurrency, CONCUR’96, Lecture Notes in Computer Science, vol. 1119, Springer, Berlin 1996, pp. 627–638.

4. A partial trace semantics for Petri nets;Diekert;Theoret. Comput. Sci.,1994

5. V. Diekert, A. Muscholl, Construction of asynchronous automata, The Book of Traces, World Scientific Publ. Co., Singapore, 1995, pp. 249–267.

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Synthesis and Analysis of Petri Nets from Causal Specifications;Computer Aided Verification;2022

2. Asynchronous Cellular Automata as Randomness Enhancer;Advances in Intelligent Systems and Computing;2022

3. A survey of cellular automata: types, dynamics, non-uniformity and applications;Natural Computing;2018-07-23

4. A Guided Tour of Asynchronous Cellular Automata;Cellular Automata and Discrete Complex Systems;2013

5. Shared-Memory Systems and Charts;Computer Science – Theory and Applications;2011