Work

Efficient Algorithm for Reachability Checking in Modeling

Year: 2012

Type: conference-paper

Abstract: The problem of reachability of the states of transition systems is considered hereby. The notions of partial unfolding and permutability of two operators (including the notion of statically permutable operators) are presented. New algorithm for reachability problem in terms of insertion modeling is described. An example of application of such algorithm is considered.

Source: International Conference on ICT in Education, Research and Industrial Applications: Integration, Harmonization and Knowledge Transfer (ICTERI)

DOI: 10.55056/ceur-ws.org/vol-848/icteri-2012-ceur-ws-paper-34-p-71-81.pdf

Authors: Alexander Letichevsky, Olexander Letychevskyi, Vladimir Peschanenko

Institutions: V.M. Glushkov Institute of Cybernetics, Kherson State University

Language: English

Topic: Formal Methods in Verification

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W2407365416

FWCI:

Cites: 8

Cited by:

Related to: 10