ACTAS : A System Design for Associative and Commutative Tree Automata Theory | Zendy

Hitoshi Ohsaki | Zendy; Toshinori Takai | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

ACTAS : A System Design for Associative and Commutative Tree Automata Theory

Author(s) -

Hitoshi Ohsaki,

Toshinori Takai

Publication year - 2005

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2004.07.017

Subject(s) - computer science , theoretical computer science , tree (set theory) , automaton , associative property , commutative property , algorithm , discrete mathematics , mathematics , combinatorics , pure mathematics

ACTAS is an integrated system for manipulating associative and commutative tree automata (AC-tree automata for short), that has various functions such as for Boolean operations of AC-tree automata, computing rewrite descendants, and solving emptiness and membership problems. In order to deal with high-complexity problems in reasonable time, over- and under-approximation algorithms are also equipped. Such functionality enables us automated verification of safety property in infinite state models, that is helpful in the domain of, e.g. network security, in particular, for security problems of cryptographic protocols allowing an equational property. In runtime of model construction, a tool support for analysis of state space expansion is provided. The intermediate status of the computation is displayed in numerical data table, and also the line graphs are generated. Besides, a graphical user interface of the system provides us a user-friendly environment for handy use

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research