All Stories

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