All Stories

  1. Kinematics of Mechanical Systems by Dynamic Geometry
  2. Modelling the Mutually Exclusive Oncogenic Mechanism
  3. Spiking neural P systems and their semantics in Haskell
  4. A process calculus for spiking neural P systems
  5. Soft Sets with Atoms
  6. The power of synchronizing rules in membrane computing
  7. Synchronization operator for communication privacy
  8. Dynamics of reputation in mobile agents systems and weighted timed automata
  9. Interval Probability for Sessions Types
  10. Knowledge Dynamics and Behavioural Equivalences in Multi-Agent Systems
  11. Type inference for hierarchical multiset structures in rule-based systems
  12. Finitely Supported Binary Relations between Infinite Atomic Sets
  13. Interior Operators Generated by Ideals in Complete Domains
  14. Fuzzy Results for Finitely Supported Structures
  15. Various forms of infinity for finitely supported structures
  16. Travelling salesman problem in tissue P systems with costs
  17. Memory associated with membranes systems
  18. Computation with cells enhanced by costs
  19. Spiking Neural P Systems with Astrocytes Producing Calcium
  20. Arithmetic Abilities of the Living Cell Pumps
  21. Reversible computation in nature inspired rule-based systems
  22. Mutual exclusion and reversibility in reaction systems
  23. Local time membrane systems and time Petri nets
  24. Foundations of Finitely Supported Structures
  25. Foundations of Reversible Computation
  26. Mobile Membranes
  27. Reversibility in Chemical Reactions
  28. Employing Costs in Multiagent Systems with Timed Migration and Timed Communication
  29. How the Formal Description of the Transmembrane Proteins can Reduce the Bio-Medical Experiments
  30. A logic featuring new nominal quantifiers designed to provide a semantics for processes
  31. Finitely Supported Sets Containing Infinite Uniformly Supported Subsets
  32. Probabilities in Session Types
  33. Fixed point results for finitely supported algebraic structures
  34. Properties of the atoms in finitely supported structures
  35. Adaptive P Systems
  36. A Semantic Investigation of Spiking Neural P Systems
  37. Verification of Multi-agent Systems with Timeouts for Migration and Communication
  38. High-Level Koutny Net
  39. Bonding calculus
  40. Analyzing the Shared Information in Social Networks
  41. A note on similarity relations between fuzzy attribute-oriented concept lattices
  42. Order Relations Over Finitely Supported Structures
  43. On the Abstractness of Continuation Semantics
  44. Solving the N-Queens Puzzle by Using Few Membranes
  45. Controlled Reversibility in Reaction Systems
  46. Denotational semantics of membrane systems by using complete metric spaces
  47. Fuzzy sets within Finitely Supported Mathematics
  48. Abstract Continuation Semantics for Asynchronous Concurrency
  49. An efficient method to factorize fuzzy attribute-oriented concept lattices
  50. Computational Power of Protein Networks
  51. Continuation Passing Semantics for Membrane Systems
  52. Analyzing Distributed Pi-Calculus Systems by Using the Rewriting Engine Maude
  53. A universality theorem for the sequential behaviour of minimal $F$-automata
  54. Verification of distributed systems involving bounded-time migration
  55. Verification of distributed systems involving bounded-time migration
  56. Verification of critical systems described in real-time TiMo 
  57. Continuation Semantics of a Language Inspired by Membrane Computing with Symport/Antiport Interactions
  58. Essential and density topologies of continuous domains
  59. Simulating P systems with membrane dissolution in a chemical calculus
  60. Modelling and verification of weighted spiking neural systems
  61. Efficiently solving the Bin Packing problem through bio-inspired mobility
  62. Abstract Interpretations in the Framework of Invariant Sets
  63. A descriptive type foundation for RDF Schema
  64. Verifying vehicle control systems by using process calculi
  65. Main Steps in Defining Finitely Supported Mathematics
  66. Solving NP-complete Problems in Polynomial Time by Using a Natural Computing Model
  67. Behavioural Analysis of Sessions Using the Calculus of Structures
  68. Finitely Supported Mathematics
  69. Extended Fraenkel-Mostowski Set Theory
  70. Fraenkel-Mostowski Set Theory: A Framework for Finitely Supported Mathematics
  71. Algebraic Structures in Finitely Supported Mathematics
  72. Process Calculi in Finitely Supported Mathematics
  73. Scalable distributed implementation of a biologically inspired parallel model
  74. Behavioural observations of cell movements with timing aspects
  75. Static Analysis in Finitely Supported Mathematics
  76. Continuation Semantics for Dynamic Hierarchical Systems
  77. Verification of membrane systems with delays via Petri nets with delays
  78. Similarity relations in fuzzy attribute-oriented concept lattices
  79. Correct metric semantics for a language inspired by DNA computing
  80. Minimal type inference for Linked Data consumers
  81. Permutative Renamings in the Extended Fraenkel-Mostowski Set Theory
  82. Computational Power of Chemical Kinetics in Living Cells
  83. Timed Mobility and Timed Communication for Critical Systems
  84. Automated Verification of Stochastic Spiking Neural P Systems
  85. Descriptive Types for Linked Data Resources
  86. Continuation Semantics for Concurrency with Multiple Channels Communication
  87. Phase-Type Approximations for Non-Markovian Systems: A Case Study
  88. Observational Equivalences in a Bio-Inspired Formalism Involving Mobility and Lifetimes
  89. Visible and Invisible Structures in Renaissance Paintings
  90. Mobility Types for Cloud Computing
  91. Strategy based semantics for mobility with time and access permissions
  92. Catalytic and communicating Petri nets are Turing complete
  93. Correct Metric Semantics for a Biologically-Inspired Formalism
  94. Expressing BBUFs Lookup Using the π-Calculus
  95. From TiMo to Event-B: Event-Driven Timed Mobility
  96. PerTiMo: A Model of Spatial Migration with Safe Access Permissions
  97. A Topological Approach in the Extended Fraenkel-Mostowski Model of Set Theory
  98. Theoretical Aspects of Computing – ICTAC 2014
  99. Theoretical Aspects of Computing
  100. A Formal Topology of Web Classification
  101. Extracting Threshold Conceptual Structures from Web Documents
  102. Behavioural Types Inspired by Cellular Thresholds
  103. PHASE: A Stochastic Formalism for Phase-Type Distributions
  104. Behavioural Equivalences in Real-Time P Systems
  105. Continuation Semantics for Asynchronous Concurrency
  106. Monitoring Changes in Dynamic Multiset Systems
  107. Nominal Groups and Their Homomorphism Theorems
  108. Algebraic Properties of Generalized Multisets
  109. Non-interleaving Operational Semantics for Geographically Replicated Databases
  110. TiMo: Timed Mobility in Distributed Systems
  111. RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS
  112. Local Type Checking for Linked Data Consumers
  113. Automatic Analysis of TiMo Systems in PAT
  114. Rewriting Systems Over Indexed Multisets
  115. Computational Power of Protein Interaction Networks
  116. Mobile Membranes with Objects on Surface as Colored Petri Nets
  117. A Probabilistic Logic for pTiMo
  118. Mobile Membranes: Computability and Complexity
  119. Real-Time Migration Properties of rTiMo Verified in Uppaal
  120. Solving the 4QBF Problem in Polynomial Time by Using the Biological-Inspired Mobility
  121. An Analysis of Correlative and Static Causality in P Systems
  122. Biologically Inspired Formalisms
  123. General patterns of interaction in stochastic fusion
  124. Nominal Fusion Calculus
  125. Timed Catalytic Petri Nets
  126. Relating Two Metric Semantics for Parallel Rewriting of Multisets
  127. A Provenance Tracking Model for Data Updates
  128. Modelling and analysis of biological systems
  129. Properties of enhanced mobile membranes via coloured Petri nets
  130. Quantitative Causality in Membrane Systems
  131. Catalytic Petri Nets Are Turing Complete
  132. Behavioural Equivalences over Migrating Processes with Timers
  133. A Timed Mobility Semantics Based on Rewriting Strategies
  134. An Extension of a Permutative Model of Set Theory
  135. On the Computability Power of Membrane Systems with Controlled Mobility
  136. Coordinating Parallel Mobile Ambients to Solve SAT Problem in Polynomial Number of Steps
  137. Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems
  138. Flexible software architecture and language for mobile agents
  139. Timed Mobility in process algebra and Petri nets
  140. Nominal Semantics of the pi I-calculus
  141. Metric Denotational Semantics for Parallel Rewriting of Multisets
  142. Time Delays in Membrane Systems and Petri Nets
  143. Mutual mobile membranes with objects on surface
  144. Mobility in Process Calculi and Natural Computing
  145. Encodings
  146. Computing by Endocytosis and Exocytosis
  147. Computability Power of Mobility in Enhanced Mobile Membranes
  148. Mobility in Process Calculi
  149. Mobility in Membrane Computing
  150. Timed Migration and Interaction with Access Permissions
  151. A Temporal Logic for Mutual Mobile Membranes with Objects on Surface
  152. A $\Sigma_2^P \cup \Pi_2^P$ Lower Bound Using Mobile Membranes
  153. Proceedings Fourth Workshop on Membrane Computing and Biologically Inspired Process Calculi 2010
  154. Adding Lifetime to Objects and Membranes in P Systems
  155. Continuation Semantics for Concurrency Applied to Parallel Rewriting of Multisets
  156. Rule-based and object-based event structures for membrane systems
  157. Reversing computation in membrane systems
  158. Enhanced Mobile Membranes: Computability Results
  159. Typed Membrane Systems
  160. Finding Network Resources by Using Mobile Agents
  161. Mobile Agents with Timers, and Their Implementation
  162. UTP and Temporal Logic Model Checking
  163. Formalizing the Behavior of Biological Processes with Mobility
  164. Evolving by Maximizing the Number of Rules: Complexity Study
  165. Computational Aspects of Mobile Membranes, Brane Calculi and Mobile Ambients
  166. Mobility in Computer Science and in Membrane Systems
  167. Flattening the Transition P Systems with Dissolution
  168. Proceedings Third Workshop on Membrane Computing and Biologically Inspired Process Calculi 2009
  169. Mutual Mobile Membranes with Timers
  170. A Methodology for Concurrent Languages Development Based on Denotational Semantics
  171. Final and sequential behaviours of M-automata
  172. ENCODINGS OF MULTISETS
  173. Rewriting Logic Specification of Membrane Systems with Promoters and Inhibitors
  174. Complexity of evolution in maximum cooperative P systems
  175. Dual P Systems
  176. A Software Platform for Timed Mobility and Timed Interaction
  177. Turing Completeness Using Three Mobile Membranes
  178. Simple, Enhanced and Mutual Mobile Membranes
  179. On the power of endocytosis and exocytosis
  180. Interaction in Time and Space
  181. On the relationship between membranes and ambients
  182. Supermetrics over Apartness Lattice-Ordered Semigroup
  183. Timed Mobile Ambients for Network Protocols
  184. Time and Space Coordination of Mobile Agents
  185. Behaviour Equivalences in Timed Distributed π-Calculus
  186. Data Compression on Multisets. Submultiset-Free Codes
  187. Resource Competition and Synchronization in Membranes
  188. Verifying Adaptive Cruise Control by Using Pi-Calculus and Mobility Workbench
  189. Describing the Immune System Using Enhanced Mobile Membranes
  190. Structural Properties and Observability in Membrane Systems
  191. Pythagoras: An Interactive Environment for Plane Geometry
  192. Translating Mobile Ambients into P Systems
  193. P systems with minimal parallelism
  194. Coordination by Timers for Channel-Based Anonymous Communications
  195. Probabilistic transitions for P systems
  196. Compositional asynchronous membrane systems
  197. A rewriting logic framework for operational semantics of membrane systems
  198. Cellular modelling using P systems and process algebra
  199. Fundamentals of Computation Theory
  200. Coordination and Self-Organization in MultiAgent Systems
  201. Timers for Distributed Systems
  202. Number Encodings and Arithmetics over Multisets
  203. Collaborative Agents Interaction Using Message Passing Interface
  204. Theory and applications of P systems
  205. A Programming Perspective of the Membrane Systems
  206. Operational Semantics and Rewriting Logic in Membrane Computing
  207. P transducers
  208. A specification language for coordinated objects
  209. MEALY MULTISET AUTOMATA
  210. Expressing Control Mechanisms of Membranes by Rewriting Strategies
  211. Distributed Evolutionary Algorithms Inspired by Membranes in Solving Continuous Optimization Problems
  212. P Machines: An Automata Approach to Membrane Computing
  213. A Topological Approach of the Web Classification
  214. Algebraic and Coalgebraic Aspects of Membrane Computing
  215. Structural Operational Semantics of P Systems
  216. "Logic will never be the same again" - Kurt Gödel Centenary
  217. Encodings and Arithmetic Operations in Membrane Computing
  218. Applications of Membrane Computing
  219. A specification language for coordinated objects
  220. Executable Specifications of P Systems
  221. A P System Description of the Sodium-Potassium Pump
  222. Communicating Concurrent Objects in HiddenCCS
  223. A Web-Based P Systems Simulator and Its Parallelization
  224. Cellular Meta-programming over Membranes
  225. Specifications and verification of network protocols by process algebra
  226. Topological spaces of the web
  227. Self-organizing Distribution of Agents over Hosts
  228. Modelling in Molecular Biology
  229. Software Verification of Biomolecular Systems
  230. Model Checking for Object Specifications in Hidden Algebra
  231. P Systems Running on a Cluster of Computers
  232. Specification and Verification of Synchronizing Concurrent Objects
  233. Describing IEEE 802.11 Wireless Mechanisms by Using the π-Calculus and Performance Evaluation Process Algebra
  234. Distributed algorithms over communicating membrane systems
  235. Conformon-driven biopolymer shape changes in cell modeling
  236. Membrane Systems and Distributed Computing
  237. Discrete Event Systems and Client-Server Model for Signaling Mechanisms
  238. Client–Server P Systems in Modeling Molecular Interaction
  239. Molecular interaction
  240. Molecular Structures
  241. JC-Nets
  242. Abstract Structures for Communication between Processes
  243. Fundamentals of Computation Theory
  244. Faithful π-nets.
  245. On certain lattice—Ordered semigroups
  246. Events, Causality, and Concurrency in Membrane Systems
  247. Modeling Cell-Mediated Immunity by Means of P Systems
  248. From Gene Regulation to Stochastic Fusion
  249. On a Formal Model of the T Cell and Its Biological Feedback
  250. Timers and Proximities for Mobile Ambients
  251. On the Reachability Problem in P Systems with Mobile Membranes
  252. Encoding Mobile Ambients into the π-Calculus
  253. On the Computational Power of Enhanced Mobile Membranes
  254. Modelling and Verification of Timed Interaction and Migration
  255. Non-interleaving Semantics with Causality for Nondeterministic Dataflow
  256. Mobile Ambients with Timers and Types
  257. Relating π-calculus to Object-Z
  258. On a Formal Model of the T Cell and Its Biological Feedback
  259. A RDF-based model for expressing spatio-temporal relations between Web sites