Algorithmics on Infinite State Systems 2012

(AISS 2012)

Algorithmics on Infinite State Systems 2012

(AISS 2012)

A satellite workshop of LICS 2012

June 29th, Dubrovnik (Croatia)

IMPORTANT DATES

Paper Submission:

~~March 20th, 2012~~

March 31st, 2012

Notification:

~~April 10th, 2012~~

April 15th, 2012

Workshop:

June 29th, 2012

Invited Speakers

"Modeling, Verification and Synthesis with Structured Transition Systems"

"Infinite, but finite up to permutation"

Program Committee

There are two main goals of the workshop:

Format

Submission

4-page abstracts should be submitted via the AISS submission page on the EasyChair system.

Scope

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

Organizers

About

Author of picture: Gari Baldi, copyright cc-by-sa-2.0