Overview

SynAsync synthesizes (if possible) an asynchronous automaton from a given finite deterministic automaton. The generated asynchronous automaton accepts the same language as the input automaton (or smaller in case the problem is relaxed).

Installation

1. Download the source code and unpack the archive.
2. Typing make should suffice to compile the synthesizer.
3. You can get a list of command-line options by calling synasync without any arguments. See also the README file for further details.

Contact

Questions can be directed to Alin Stefanescu.

Links

• Research Project Automatic Synthesis of Distributed Systems (EPSRC Grant R64322/01) including the bibliography related to SynAsync
• Logic implementations complementing SynAsync with two heuristics
• Petrify - a tool for synthesis of Petri nets and asynchronous circuits
• Synet - a synthesizer of distributable bounded Petri nets from finite automata