AISS 2013 - Workshop on ALGORITHMICS ON INFINITE STATE SYSTEMS 2013

Topics include but are not restricted to (no order):
- abstract machine models for infinite state systems (e.g. pushdown systems, higher-order pushdown systems, one-counter machines)
- Petri nets
- automatic structures
- well-structured transition systems
- rewriting formalisms for infinite state systems (e.g. ground tree rewriting)
- higher-order recursion schemes
- algorithmic model theory
- games on infinite arenas
- model checking for infinite state systems (e.g. model checking for MSO, FO, CTL, LTL, mu-calculus)
- equivalence checking of infinite state systems, (e.g. bisimilarity checking)
- decomposition techniques for infinite state systems (e.g. Feferman/Vaught decompositions)
- reachability in infinite state systems