Hüsnü Yenigün

Learn More
1 I n t r o d u c t i o n One c o m m o n me thod for dealing with the intrinsically intractable computa t iona l complexi ty of model-checking asynchronous systems is partial order reduction. This reduct ion technique exploits the c o m m o n practice of model ing concurrent events in asynchronous systems as an interleaving of the events in all possible(More)
Under certain well–defined conditions, determining the correctness of a system under test (SUT) is based on a checking sequence generated from a finite state machine (FSM) specification of the SUT. When there is a distinguishing sequence for the FSM, an efficient checking sequence may be produced from the elements of a set Eα′ of α sequences that verify(More)
Combining verification methods developed separately for software and hardware is motivated by the industry’s need for a technology that would make formal verification of realistic software/hardware co-designs practical. We focus on techniques that have proved successful in each of the two domains: BDD-based symbolic model checking for hardware verification(More)
Based on a distinguishing sequence for a Finite State Machine (FSM), an efficient checking sequence may be produced from the elements of a set Eα′ of α′–sequences and a set ET of T–sequences, that both recognize the states, and elements of EC which represents the transitions in the FSM. An optimization algorithm may then be used to produce a reduced length(More)
Vehicle routing problems have various extensions such as time windows, multiple vehicles, backhauls, simultaneous delivery and pick-up, etc. The objectives of all these problems are to design optimal routes minimizing total distance traveled, minimizing number of vehicles, etc that satisfy corresponding constraints. In this study, an ant colony optimization(More)
Dependence analysis on an Extended Finite State Machine representation of the requirements of a system under test identifies various types of control and data dependencies between transitions caused by a set of modifications on the requirements. These particular types of dependencies capture the effects of the modifications, that is, their direct effects on(More)
Methods for testing from Finite State Machine-based specifications often require the existence of a preset distinguishing sequence for constructing checking sequences. It has been shown that an adaptive distinguishing sequence is sufficient for these methods. This result is significant because adaptive distinguishing sequences are strictly more common and(More)
If a finite state machine M does not have a distinguishing sequence, but has UIO sequences for its states, there are methods to produce a checking sequence for M . However, if M has a distinguishing sequence D̄, then there are methods that make use of D̄ to construct checking sequences that are much shorter than the ones that would be constructed by using(More)
Dependence analysis on an extended finite state machine (EFSM) representation of the requirements of a system under test has been used in model-based regression testing for regression test suite (RTS) reduction (reducing the size of a given test suite by eliminating redundancies), for RTS prioritization (ordering test cases in a given test suite for early(More)
  • Selim Balcısoy, Berrin Yanıkoğlu, +5 authors Ekrem Serin
  • 2006
Visualization techniques for geographic data show vast variations which are welldeveloped over centuries. While most of the known techniques are sound for low dimensional data sets, few techniques exist for visualization of high dimensional data within the geographic framework. This thesis investigates visualization of temporal, high dimensional network(More)