All Stories

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