All Stories

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