RESETting Timed Machines

Stulman, Ariel
March 2011
Journal of Computing & Information Technology;Mar2011, Vol. 19 Issue 1, p11
Academic Journal
No abstract available.


Related Articles

  • On the Complexity of Generating Optimal Test Sequences. Boyd, Sylvia C.; Ural, Hasan // IEEE Transactions on Software Engineering;Sep91, Vol. 17 Issue 9, p976 

    As communications protocols are becoming more and more complex, efficient algorithms are needed for the problem of generating minimum-length test sequences. Existing algorithms generate test sequences based on one or more state-identification sequences for every state in a given finite-state...

  • Automatic Test Cases Generation for Statechart Specifications from Semantics to Algorithm. Lina Chen // Journal of Computers;Apr2011, Vol. 6 Issue 4, p769 

    This paper studies automatic test cases generation for Statechart specifications. Applying Tretmans' approach to generate test cases from labeled transition systems, we provide a solid mathematical basis for conformance testing and automatic test case generation for Statechart specifications. In...

  • Specifications Mining Based on Adjusted Automata Learning Algorithm. Xiao Jianyu; Dai Jingguo // Information Technology Journal;2012, Vol. 11 Issue 10, p1391 

    The problem of software's specifications mining was to automatically acquire temporal safety properties of a software based on its execution traces, which was represented as a DFA-enforceable security automata. It is similar to the problem of automata learning which had been studied in the field...

  • A Generalized Approach to Linear Transform Approximations with Applications to the Discrete Cosine Transform. Yinpeng Chen; Sundaram, Hari // EURASIP Journal on Advances in Signal Processing;2008, p1 

    This paper aims to develop a generalized framework to systematically trade off computational complexity with output distortion in linear transforms such as the DCT, in an optimal manner. The problem is important in real-time systems where the computational resources available are time-dependent....

  • ESTIMATION OF PASSENGER WAITING TIME IN ELEVATOR SYSTEM WITH ARTIFICIAL NEURAL NETWORK. Dursun, Mahir // Intelligent Automation & Soft Computing;Mar2010, Vol. 16 Issue 1, p101 

    In this study, a simulation program for elevator control system with 10 floor apartment with 300 people was prepared by using C++ builder programming language. In simulation program, the cabin was controlled with both artificial neural network (ANN) and traditional methods under 10 different...

  • A portable, unobtrusive device for videorecording clinical interactions. Albrecht, Terrance L.; Ruckdeschel, John C.; Ray III, Fountain L.; Pethe, Ben J.; Riddle, Dawn L.; Strohm, Joan; Penner, Louis A.; Coovert, Michael D.; Quinn, Gwendolyn; Blanchard, Christina G. // Behavior Research Methods;Feb2005, Vol. 37 Issue 1, p165 

    Recording and analyzing real-time interactions in clinical settings is important for basic and applied research in psychology and other disciplines. Investigators frequently have used simple audiotaping procedures to record these encounters (e.g., Roter, Geller, Bernhardt, "Larson, & Doksum,...

  • Slicing communicating automata specifications: polynomial algorithms for model reduction. LabbĂ©, SĂ©bastien; Gallois, Jean-Pierre // Formal Aspects of Computing;Dec2008, Vol. 20 Issue 6, p563 

    In the industry, communicating automata specifications are mainly used in fields where the reliability requirements are high, as this formalism allow the use of powerful validation tools. Still, on large scale industrial specifications, formal methods suffer from the combinatorial explosion...

  • Testing a deterministic implementation against a non-controllable non-deterministic stream X-machine. Hierons, Robert; Ipate, Florentin // Formal Aspects of Computing;Dec2008, Vol. 20 Issue 6, p597 

    A stream X-machine (SXM) is a type of extended finite state machine with an associated development approach that consists of building a system from a set of trusted components. One of the great benefits of using SXMs for the purpose of specification is the existence of test generation techniques...

  • Timed Automata Patterns. Jin Song Dong; Ping Hao; Shengchao Qin; Jun Sun; Wang Yi // IEEE Transactions on Software Engineering;Nov/Dec2008, Vol. 34 Issue 6, p844 

    Timed Automata have proven to be useful for specification and verification of real-time systems. System design using Timed Automata relies on explicit manipulation of clock variables. A number of automated analyzers for Timed Automata have been developed. However, Timed Automata lack composable...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics