All Stories

  1. Arithmetic abilities of SNP systems with astrocytes producing calcium
  2. Introducing variables in the evolution rules of P systems
  3. Solving subset sum and SAT problems by reaction systems
  4. Formal Analysis of Medical Systems using Multi-Agent Systems with Information Sharing
  5. Relating Various Types of Distributed Reaction Systems
  6. Relating randomized right-hand sides to communicating rewriting rules
  7. Solving SAT with P systems with anti-membranes
  8. New Editorial Team for SACS after 16 Years
  9. Modelling the Mutually Exclusive Oncogenic Mechanism
  10. Theories of life and computation
  11. Solving subset sum by spiking neural P systems with astrocytes producing calcium
  12. Membrane Computing after 25 Years
  13. The power of synchronizing rules in membrane computing
  14. Synchronization operator for communication privacy
  15. Stochastic sharing calculus for reasoning about social networks
  16. On the efficiency of synchronized P systems
  17. Dynamics of reputation in mobile agents systems and weighted timed automata
  18. From Networks of Reaction Systems to Communicating Reaction Systems and Back
  19. Interval Probability for Sessions Types
  20. Computational Power of Astrocytes and their Role in Neurobiology
  21. Knowledge Dynamics and Behavioural Equivalences in Multi-Agent Systems
  22. Type inference for hierarchical multiset structures in rule-based systems
  23. Travelling salesman problem in tissue P systems with costs
  24. Computation with cells enhanced by costs
  25. Spiking Neural P Systems with Astrocytes Producing Calcium
  26. Arithmetic Abilities of the Living Cell Pumps
  27. Reversible computation in nature inspired rule-based systems
  28. Mutual exclusion and reversibility in reaction systems
  29. Local time membrane systems and time Petri nets
  30. Foundations of Reversible Computation
  31. Mobile Membranes
  32. Reversibility in Chemical Reactions
  33. Employing Costs in Multiagent Systems with Timed Migration and Timed Communication
  34. How the Formal Description of the Transmembrane Proteins can Reduce the Bio-Medical Experiments
  35. A logic featuring new nominal quantifiers designed to provide a semantics for processes
  36. Synchronization of rules in membrane computing
  37. Probabilities in Session Types
  38. Adaptive P Systems
  39. Verification of Multi-agent Systems with Timeouts for Migration and Communication
  40. Bonding calculus
  41. Analyzing the Shared Information in Social Networks
  42. Solving the N-Queens Puzzle by Using Few Membranes
  43. Controlled Reversibility in Reaction Systems
  44. Methods for Distributed and Concurrent Systems: Special Issue on the occasion of the 60th Birthday of Professor Gabriel Ciobanu
  45. Computational Power of Protein Networks
  46. Analyzing Distributed Pi-Calculus Systems by Using the Rewriting Engine Maude
  47. Verification of distributed systems involving bounded-time migration
  48. Simulating R Systems by P Systems
  49. Verification of critical systems described in real-time TiMo 
  50. Simulating P systems with membrane dissolution in a chemical calculus
  51. Modelling and verification of weighted spiking neural systems
  52. Efficiently solving the Bin Packing problem through bio-inspired mobility
  53. Solving NP-complete Problems in Polynomial Time by Using a Natural Computing Model
  54. Behavioural observations of cell movements with timing aspects
  55. Verification of membrane systems with delays via Petri nets with delays
  56. Timed Mobility and Timed Communication for Critical Systems
  57. Automated Verification of Stochastic Spiking Neural P Systems
  58. Mobility Types for Cloud Computing
  59. Behavioural Types Inspired by Cellular Thresholds
  60. Behavioural Equivalences in Real-Time P Systems
  61. Matter and Anti-Matter in Membrane Systems
  62. P Systems with Anti-Matter
  63. Red–Green P Automata
  64. RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS
  65. Computational Power of Protein Interaction Networks
  66. Mobile Membranes with Objects on Surface as Colored Petri Nets
  67. Real-Time Migration Properties of rTiMo Verified in Uppaal
  68. Timed Catalytic Petri Nets
  69. Properties of enhanced mobile membranes via coloured Petri nets
  70. Behavioural Equivalences over Migrating Processes with Timers
  71. On the Computability Power of Membrane Systems with Controlled Mobility
  72. Coordinating Parallel Mobile Ambients to Solve SAT Problem in Polynomial Number of Steps
  73. Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems
  74. Time Delays in Membrane Systems and Petri Nets
  75. Mutual mobile membranes with objects on surface
  76. Mobility in Process Calculi and Natural Computing
  77. Encodings
  78. Computing by Endocytosis and Exocytosis
  79. Mobility in Process Calculi
  80. Mobility in Membrane Computing
  81. A Temporal Logic for Mutual Mobile Membranes with Objects on Surface
  82. Adding Lifetime to Objects and Membranes in P Systems
  83. Typed Membrane Systems
  84. Formalizing the Behavior of Biological Processes with Mobility
  85. Computational Aspects of Mobile Membranes, Brane Calculi and Mobile Ambients
  86. Mutual Mobile Membranes with Timers
  87. Turing Completeness Using Three Mobile Membranes
  88. Simple, Enhanced and Mutual Mobile Membranes
  89. Type Disciplines for Analysing Biologically Relevant Properties
  90. On the relationship between membranes and ambients
  91. Timed Mobile Ambients for Network Protocols
  92. Resource Competition and Synchronization in Membranes
  93. Describing the Immune System Using Enhanced Mobile Membranes
  94. Structural Properties and Observability in Membrane Systems
  95. Translating Mobile Ambients into P Systems
  96. Timers and Proximities for Mobile Ambients
  97. On the Reachability Problem in P Systems with Mobile Membranes
  98. Mobile Ambients with Timers and Types