Toshinori Takai

Toshinori Takai
Nara Institute of Science and Technology | NAIST · Graduate School of Information Science

PhD

About

30
Publications
949
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
240
Citations
Citations since 2016
5 Research Items
21 Citations
201620172018201920202021202202468
201620172018201920202021202202468
201620172018201920202021202202468
201620172018201920202021202202468

Publications

Publications (30)
Conference Paper
Full-text available
Developing Internet of Things(IoT) systems is non-trivial because diverse solution spaces must be simultaneously satisfied due to the intrinsic nature of IoT systems. To address this challenge, we proposed a method chain approach called the continuous modeling support process for business analysis and solution requirements in IoT development(COMP4B...
Article
Assurance cases are documents for arguing that systems satisfy required properties such as safety and security in the given environment based on sufficient evidence. As systems become complex and networked, the importance of assurance cases has become significant. However, we observe that creating assurance cases has some essential difficulties, an...
Article
An assurance case is a document containing arguments about risk-related issues on a system and regarded as an effective means to achieve open systems dependability. This paper proposes a notation of an assurance case to deal with changes of a system which can pose challenges to an established assurance case. The proposed notation is based on GSN an...
Article
We address the problem of constructing an assurance case by presenting an approach to extract information from a large set of documents. In the proposed approach, document retrieval and formal concept analysis techniques are systematically combined for assisting users to explore relevant information from huge data set and to understand a number of...
Conference Paper
Full-text available
Regulations/standards for safety critical systems mandate the submission of safety cases. Even though safety cases are the basic framework for assuring the safety of systems, how they fit into other methods/techniques which ensure the quality of the system is not certain. Ensuring traceability is of particular importance, since traceability can hel...
Article
We propose Clinico-Informatics, as a research field for dealing with risks of information systems based on informatics. In this paper, we concentrate on extracting a general model of technology transfers from the author's experiences, i.e. transferring mathematical system verification techniques to the fields of system development. We consider a ge...
Article
We propose clinico-informatics, as a research field for dealing with risks of information systems based on informatics. In this paper, we consider a model of technology transfer from the authors' experiences, i.e. transferring verification technology to industry in the various fields which involves information system development. A scenario for tec...
Article
In order to evaluate the performance of temporal logic satisfiability checkers, a benchmark with test formulas is required, as well as analysis of the complexity of algorithms. However, there seem to be no clear criteria of the formulas for benchmarks. Thus, to evaluate the performance of satisfiability checkers for new logics, we must prepare test...
Conference Paper
We propose a quasi-equational sound axiomatization of regular tree languages, called monodic tree Kleene algebra. The algebra is weaker than Kleene algebra introduced by Kozen. We find a subclass of regular tree languages, for which monodic tree Kleene algebra is complete. While regular tree expressions may have two or more kinds of place holders,...
Article
Full-text available
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- a...
Conference Paper
Verifying the safety property of a transition system given by a term rewriting system is an undecidable problem. In this paper, we give an abstraction for the problem which is automatically generated from a given TRS by using abstract interpretation. Then we show that there are some cases in which the problem can be decided. Also we show a new deci...
Conference Paper
This paper provides an algorithm to compute the comple- ment of tree languages recognizable with A-TA (tree automata with as- sociativity axioms (16)). Due to this closure property together with the previously obtained results, we know that the class is boolean closed, while keeping recognizability of A-closures of regular tree languages. In the pr...
Article
An extension of tree automata framework, called equational tree automata, is presented. This theory is useful to deal with unification modulo equational rewriting. In the manuscript, we demonstrate how equational tree automata can be applied to unification problems.
Article
A term rewriting system which effectively preserves recognizability (EPR-TRS) has good mathematical properties. In this paper, a new subclass of TRSs, layered transducing TRSs (LT-TRSs) is defined and its recognizability preserving property is discussed. The class of LT-TRSs contains some EPR-TRSs, e.g., {f(x) ¿ f(g(x))} which do not belong to any...
Conference Paper
Equational tree automata provide a powerful tree language framework that facilitates to recognize congruence closures of tree languages. In the paper we show the emptiness problem for AC-tree automata and the intersection-emptiness problem for regular AC-tree automata, each of which was open in our previous work [20], are decidable, by a straightfo...
Article
We propose a new decidable subclass of term rewriting systems (TRSs) for which strongly normalizing (SN) property is decidable. The new class is called almost orthogonal inverse finite path overlapping TRSs (AO-FPO -1-TRSs) and the class properly includes AO growing TRSs for which SN is decidable. Tree automata technique is used to show that SN is...
Article
We propose a new decidable subclass of term rewriting systems (TRSs) for which strongly normalizing (SN) property is decidable. The new class is called almost orthogonal inverse finite path overlapping TRSs (AO-FPO-1-TRSs) and the class properly includes AO growing TRSs for which SN is decidable. Tree automata technique is used to show that SN is d...
Conference Paper
Right-linear finite path overlapping TRS are shown to effectively preserve recognizability. The class of right-linear finite path overlapping TRS properly includes the class of linear generalized semi-monadic TRS and the class of inverse left-linear growing TRS, which are known to effectively preserve recognizability. Approximations by inverse righ...
Article
The authors have proposed a procedure for solving an order-sorted unification problem in an equational theory which is defined by a confluent TRS. The procedure requires an instance of the problem to satisfy that the TRS is right-linear and the goal terms are linear and share no variables. If a given instance of the problem satisfies these conditio...
Article
ACTAS is a tool set manipulating associative and commu-tative tree automata (AC-tree automata for short). The sys-tem is equipped with various functions for Boolean opera-tions and rewrite descendant computation. This function-ality allows to verify safety property in infinite state mod-els, which is helpful in the domain of network security, in pa...
Article
We propose a new decidable subclass of term rewriting systems (TRSs) for which strongly normalizing (SN) property is decidable. The new class is called almost orthogonal inverse finite path overlap- ping TRSs (AO-FPO ¡1 -TRSs) and the class properly includes AO growing TRSs for which SN is decidable. Tree automata technique is used to show that SN...
Article
http://library.naist.jp/mylimedio/dllimedio/show.cgi?bookid=20628 修士 (Master) 工学 (Engineering) 修第775号
Article
http://library.naist.jp/mylimedio/dllimedio/show.cgi?bookid=60902 博士 (Doctor) 工学 (Engineering) 博第244号 甲第243号
Article
An extension of tree automata framework, called equational tree automata, is presented. This theory is useful to deal with unification modulo equational rewriting. In the manuscript, we demonstrate how equational tree automata can be applied to several realistic unification examples, e.g. including a security problem of network protocols.

Network

Cited By