2,600 research outputs found

    Constraint-Based Heuristic On-line Test Generation from Non-deterministic I/O EFSMs

    Full text link
    We are investigating on-line model-based test generation from non-deterministic output-observable Input/Output Extended Finite State Machine (I/O EFSM) models of Systems Under Test (SUTs). We propose a novel constraint-based heuristic approach (Heuristic Reactive Planning Tester (xRPT)) for on-line conformance testing non-deterministic SUTs. An indicative feature of xRPT is the capability of making reasonable decisions for achieving the test goals in the on-line testing process by using the results of off-line bounded static reachability analysis based on the SUT model and test goal specification. We present xRPT in detail and make performance comparison with other existing search strategies and approaches on examples with varying complexity.Comment: In Proceedings MBT 2012, arXiv:1202.582

    The Reach-Avoid Problem for Constant-Rate Multi-Mode Systems

    Full text link
    A constant-rate multi-mode system is a hybrid system that can switch freely among a finite set of modes, and whose dynamics is specified by a finite number of real-valued variables with mode-dependent constant rates. Alur, Wojtczak, and Trivedi have shown that reachability problems for constant-rate multi-mode systems for open and convex safety sets can be solved in polynomial time. In this paper, we study the reachability problem for non-convex state spaces and show that this problem is in general undecidable. We recover decidability by making certain assumptions about the safety set. We present a new algorithm to solve this problem and compare its performance with the popular sampling based algorithm rapidly-exploring random tree (RRT) as implemented in the Open Motion Planning Library (OMPL).Comment: 26 page

    Applying Formal Methods to Networking: Theory, Techniques and Applications

    Full text link
    Despite its great importance, modern network infrastructure is remarkable for the lack of rigor in its engineering. The Internet which began as a research experiment was never designed to handle the users and applications it hosts today. The lack of formalization of the Internet architecture meant limited abstractions and modularity, especially for the control and management planes, thus requiring for every new need a new protocol built from scratch. This led to an unwieldy ossified Internet architecture resistant to any attempts at formal verification, and an Internet culture where expediency and pragmatism are favored over formal correctness. Fortunately, recent work in the space of clean slate Internet design---especially, the software defined networking (SDN) paradigm---offers the Internet community another chance to develop the right kind of architecture and abstractions. This has also led to a great resurgence in interest of applying formal methods to specification, verification, and synthesis of networking protocols and applications. In this paper, we present a self-contained tutorial of the formidable amount of work that has been done in formal methods, and present a survey of its applications to networking.Comment: 30 pages, submitted to IEEE Communications Surveys and Tutorial

    Flexible manufacturing system utilizing computer integrated control and modeling

    Get PDF
    In today\u27s fast-automated production, Flexible Manufacturing Systems (FMS) play a very important role by processing a variety of different types of workpieces simultaneously. This study provides valuable information about existing FMS workcells and brings to light a unique concept called Programmable Automation. Another integrated concept of programmable automation that is discussed is the use of two feasibility approaches towards modeling and controlling FMS operations; the most commonly used is programmable logic controllers (PLC), and the other one, which has not yet implemented in many industrial applications is Petri Net controllers (PN). This latter method is a unique powerful technique to study and analyze any production line or any facility, and it can be used in many other applications of automatic control. Programmable Automation uses a processor in conventional metal working machines to perform certain tasks through program instructions. Drilling, milling and chamfering machines are good examples for such automation. Keeping the above issues in concem; this research focuses on other core components that are used in the FMS workcell at New Jersey Institute of Technology, such as; industrial robots, material handling system and finally computer vision
    corecore