some image logo

HOME

SEARCH

CURRENT ISSUE

REGULAR ISSUES

   Volume 1 (2005)

   Volume 2 (2006)

   Volume 3 (2007)

   Volume 4 (2008)

   Volume 5 (2009)

   Volume 6 (2010)

   Volume 7 (2011)

   Volume 8 (2012)

   Volume 9 (2013)

      Issue 1

      Issue 2

      Issue 3

      Issue 4

   Volume 10 (2014)

   Volume 11 (2015)

   Volume 12 (2016)

SPECIAL ISSUES

SURVEY ARTICLES

AUTHORS

ABOUT

SERVICE

LOGIN

FAQ

SUPPORT

CONTACT

VOLUME 9, ISSUE 2


1. Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
  Luis Barguńó, Carles Creus, Guillem Godoy, Florent Jacquemard and Camille Vacher


2. The degree structure of Weihrauch-reducibility
  Kojiro Higuchi and Arno Pauly


3. Infinite sequential Nash equilibrium
  Stephane Le Roux


4. Two Variable vs. Linear Temporal Logic in Model Checking and Games
  Michael A Benedikt, Rastislav Lenhardt and James Worrell


5. Total Representations
  Victor Selivanov


6. Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width
  John Fearnley and Sven Schewe


7. Bisimulations Meet PCTL Equivalences for Probabilistic Automata
  Lei Song, Lijun Zhang, Jens Chr. Godskesen and Flemming Nielson


8. Effective Characterizations of Simple Fragments of Temporal Logic Using Carton--Michel Automata
  Sebastian Preugschat and Thomas Wilke


9. Admissibility in Finitely Generated Quasivarieties
  George Metcalfe and Christoph Röthlisberger


10. Tree-Automatic Well-Founded Trees
  Martin Huschenbett, Alexander Kartzow, Jiamou Liu and Markus Lohrey


11. Unifying the Linear Time-Branching Time Spectrum of Process Semantics
  David de Frutos Escrig, Carlos Gregorio-Rodríguez, Miguel Palomino and David Romero Hernández


12. Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems
  Roy Mennicke


13. Lower Bound on Weights of Large Degree Threshold Functions
  Vladimir V. Podolskii


14. Markov two-components processes
  Samy Abbes


Creative Commons