Using well-structured transition systems to decide divergence for catalytic P systems

DOI10.1016/J.TCS.2006.11.021zbMath1111.68037OpenAlexW2064424797MaRDI QIDQ872196

Nadia Busi

Publication date: 27 March 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.11.021

zbMATH Keywords

decidabilitysystemmembrane computingcatalyticwell-structured transition system

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (10)

Properties of Membrane Systems ⋮ Systolic Automata and P Systems ⋮ Minimal probabilistic P systems for modelling ecological systems ⋮ Modeling dependencies and simultaneity in membrane system computations ⋮ Simulation of spatial P system models ⋮ Understanding and enhancement of internal clustering validation indexes for categorical data ⋮ Compositional semantics and behavioral equivalences for P systems ⋮ Compositional semantics of spiking neural P systems ⋮ AN OVERVIEW ON OPERATIONAL SEMANTICS IN MEMBRANE COMPUTING ⋮ Nadia Busi's publications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deterministic catalytic systems are not universal
• The power of catalysts and priorities in membrane systems
• Computing with membranes
• Computationally universal P systems without priorities: Two catalysts are sufficient
• Membrane computing. An introduction.
• Implementation and Application of Automata
• Well-structured transition systems everywhere!

This page was built for publication: Using well-structured transition systems to decide divergence for catalytic P systems