Acta Informatica, Volume 46

Volume 46, Number 1, February 2009

• Laura Bozzelli, Mojmír Kretínský, Vojtech Rehák, Jan Strejcek:
  On decidability of LTL model checking for process rewrite systems. 1-28
  
• Vince Bárány:
  Semi-synchronous transductions. 29-42
  
• Rza Bashirov, Fabrice Kordon, Hüseyin Lort:
  Exploiting colored Petri nets to decide on permutation admissibility. 43-55
  
• Amir M. Ben-Amram:
  A complexity tradeoff in ranking-function termination proofs. 57-72
  
• Alex A. Aravind, Wim H. Hesselink:
  A queue based mutual exclusion algorithm. 73-86
  

Volume 46, Number 2, April 2009

• Roland Meyer:
  A theory of structural stationarity in the pi -Calculus. 87-137
  
• Joost Engelfriet:
  The time complexity of typechecking tree-walking tree transducers. 139-154
  
• K. Subramani, Hong-Jian Lai, Xiaofeng Gu:
  Random walks for selected boolean implication and equivalence problems. 155-168
  

Volume 46, Number 3, May 2009

• Zdenek Sawa, Petr Jancar:
  Hardness of equivalence checking for composed finite-state systems. 169-191
  
• Cezar Câmpeanu, Nicolae Santean:
  On the closure of pattern expressions languages under intersection with regular languages. 193-207
  
• Flavio Corradini, Maria Rita Di Berardini, Walter Vogler:
  Liveness of a mutex algorithm in a fair process algebra. 209-235
  
• Eike Best, Philippe Darondeau:
  A decomposition theorem for finite persistent transition systems. 237-254
  

Volume 46, Number 4, July 2009

• Achim D. Brucker, Burkhart Wolff:
  Semantics, calculi, and analysis for object-oriented specifications. 255-284
  
• Kamilla Klonowska, Lars Lundberg, Håkan Lennerstad:
  The maximum gain of increasing the number of preemptions in multiprocessor scheduling. 285-295
  
• José Enrique Armendáriz-Iñigo, José Ramón González de Mendívil, José Ramón Garitagoitia, Francesc D. Muñoz-Escoí:
  Correctness proof of a database replication protocol under the perspective of the I/O automaton model. 297-330
  

Volume 46, Number 5, August 2009

• Davide Bresolin, Angelo Montanari, Gabriele Puppis:
  A theory of ultimately periodic languages and automata with an application to time granularity. 331-360
  
• Gabriel Ciobanu, Sergiu Rudeanu:
  Final and sequential behaviours of M-automata. 361-374
  
• Jan A. Bergstra, C. A. Middelburg:
  Machine structure oriented control code logic. 375-401
  

Volume 46, Number 6, October 2009

• Paolo Zuliani:
  Reasoning about faulty quantum programs. 403-432
  
• Victor Khomenko, Mark Schäfer, Walter Vogler, Ralf Wollowski:
  STG decomposition strategies in combination with unfolding. 433-474
  

Volume 46, Number 7, November 2009

• Md. Sumon Shahriar, Jixue Liu:
  Preserving key in XML data transformation. 475-507
  
• Argimiro Arratia Quesada, Iain A. Stewart:
  On the power of deep pushdown stacks. 509-531
  
• Jan Janousek, Borivoj Melichar:
  On regular tree languages and deterministic pushdown automata. 533-547
  

Volume 46, Number 8, December 2009

• John Aycock, Angelo Borsotti:
  Early action in an Earley parser. 549-559
  
• Joost Engelfriet, Eric Lilin, Andreas Maletti:
  Extended multi bottom-up tree transducers. 561-590
  
• Arturo Carpi, Flavio D'Alessandro:
  Strongly transitive automata and the Cerný conjecture. 591-607
  

Last update Tue Feb 14 04:13:37 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page