Theoretical Computer Science, Volume 404

Volume 404, Numbers 1-2, September 2008

• Grzegorz Rozenberg:
  Preface. 1-2
  

• Nadia Busi, Claudio Zandron:
  Foreword. 3-4
  

• Luca Cardelli:
  Bitonal membrane systems: Interactions of biological membranes. 5-18
  
• Gheorghe Paun:
  Membrane computing and brane calculi. Old, new, and future bridges. 19-25
  

• Robert Brijder, Matteo Cavaliere, Agustin Riscos-Núñez, Grzegorz Rozenberg, Dragos Sburlan:
  Membrane systems with proteins embedded in membranes. 26-39
  
• Matteo Cavaliere, Sean Sedwards:
  Decision problems in membrane systems with peripheral proteins, transport and evolution. 40-51
  
• Erzsébet Csuhaj-Varjú, György Vaszil:
  (Mem)brane automata. 52-60
  
• Pierre-Louis Curien, Vincent Danos, Jean Krivine, Min Zhang:
  Computational self-assembly. 61-75
  
• Daniel Díaz-Pernil, Miguel A. Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez:
  A uniform family of tissue P systems with cell division solving 3-COL in a linear time. 76-87
  
• Giuditta Franco, Maurice Margenstern:
  A DNA computing inspired computational model. 88-96
  
• Nil Geisweiller, Jane Hillston, Marco Stenico:
  Relating continuous and discrete PEPA models of signalling pathways. 97-111
  
• Jetty Kleijn, Maciej Koutny:
  Processes of membrane systems with promoters and inhibitors. 112-126
  
• Cosimo Laneve, Fabien Tarissan:
  A simple calculus for proteins and cells. 127-141
  
• Vincenzo Manca:
  The metabolic algorithm for P systems: Principles and applications. 142-155
  
• Alessandro Romanel, Corrado Priami:
  On the decidability and complexity of the structural congruence for beta-binders. 156-169
  
• Sergey Verlan, Francesco Bernardini, Marian Gheorghe, Maurice Margenstern:
  Generalized communicating P systems. 170-184
  

Volume 404, Number 3, September 2008

• Tiziana Margaria, Bernhard Steffen:
  Preface. 185
  

• Altaf Hussain, Michael Huth:
  On model checking multiple hybrid views. 186-201
  
• Shoham Ben-David, Dana Fisman, Sitvanit Ruah:
  Embedding finite automata within regular expressions. 202-218
  
• Shady Copty, Shai Fine, Shmuel Ur, Elad Yom-Tov, Avi Ziv:
  A probabilistic alternative to regression suites. 219-234
  
• Muffy Calder, Alice Miller:
  An automatic abstraction technique for verifying featured, parameterised systems. 235-255
  
• Franjo Ivancic, Zijiang Yang, Malay K. Ganai, Aarti Gupta, Pranav Ashar:
  Efficient SAT-based bounded model checking for software verification. 256-274
  
• Saddek Bensalem, Doron Peled, Hongyang Qu, Stavros Tripakis:
  Automatic generation of path conditions for concurrent timed systems. 275-292
  
• Jens Schönherr, Martin Freibothe, Bernd Straube, Jörg Bormann:
  Semi-formal verification of the steady state behavior of mixed-signal circuits by SAT-based property checking. 293-307