Behavioral complexity indicators for process algebra: The NKS approach

DOI10.1016/J.JLAP.2007.02.004MaRDI QIDQ2373650zbMATH OpenOpenAlexWikidataFDO

Authors Tommaso Bolognesi

Publication date 16 July 2007

Published in The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jlap.2007.02.004

zbMATH Keywords

complexity indicatorelementary cellular automataNKSprocess algebrapseudo-random number generatorTuring completeness

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cellular automata (computational aspects) (68Q80) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 3896307
• scientific article; zbMATH DE number 1818513
• A NONLINEAR DYNAMICS PERSPECTIVE OF WOLFRAM'S NEW KIND OF SCIENCE PART III: PREDICTING THE UNPREDICTABLE
• Symmetry and complexity of cellular automata: towards an analytical theory of dynamical system
• Computation theory of cellular automata

Cites work

• A calculus of communicating systems
• A calculus of mobile processes. II
• scientific article; zbMATH DE number 1818513 (Why is no real title available?)
• scientific article; zbMATH DE number 3896316 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 1956609 (Why is no real title available?)
• Machines, Computations, and Universality
• Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators
• Process algebra for synchronous communication
• The Definition of Universal Turing Machine

Describes a project that uses

Uses Software

• LOTOS

This page was built for publication: Behavioral complexity indicators for process algebra: The NKS approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373650)