Filters








36,790 Hits in 7.8 sec

A Bounded Incremental Test Generation Algorithm for Finite State Machines [chapter]

Zoltán Pap, Mahadevan Subramaniam, Gábor Kovács, Gábor Árpád Németh
2007 Lecture Notes in Computer Science  
We propose a bounded incremental algorithm to generate test cases for deterministic finite state machine models.  ...  We utilize an existing test set available for a previous version of the system to efficiently generate tests for the current -modified -system.  ...  Conclusion We have presented a bounded incremental algorithm to generate test cases for deterministic finite state machine models.  ... 
doi:10.1007/978-3-540-73066-8_17 fatcat:him66rtx3rdf7hmty27vl5csz4

Learn and Test for Event-B – A Rodin Plugin [chapter]

Ionut Dinca, Florentin Ipate, Laurentiu Mierla, Alin Stefanescu
2012 Lecture Notes in Computer Science  
In order to complement these techniques with test generation and state model inference from Event-B models, we developed a new feature as a Rodin plugin.  ...  The Event-B method is a formal approach for reliable systems specification and verification, being supported by the Rodin platform, which includes mature plugins for theorem-proving, model-checking, or  ...  There are many existing methods for test generation from finite state models.  ... 
doi:10.1007/978-3-642-30885-7_32 fatcat:w2l4qywvirhknchwjcrijlm6jq

Formal Verification of Safety Properties Using Interpolation and k-induction [article]

Tephilla Prince, Atif Abdur Rahman, Sheerazuddin Syed
2022 arXiv   pre-print
We also do a comparative analysis of these two model checking algorithms.  ...  This technical report presents implementation of two symbolic model checking algorithms that use SAT/SMT Solvers, namely interpolation based model checking and k-induction based model checking.  ...  ANTLR We have used ANTLR (Another Tool for Language Recognition) for input preprocessing of finite state machines. ANTLR is a parser generator.  ... 
arXiv:2207.01338v1 fatcat:dmb64mbgobcrre36amidblmzbe

Solving POMDPs by Searching in Policy Space [article]

Eric A. Hansen
2013 arXiv   pre-print
, from a start state.  ...  This paper presents an approach to solving POMDPs that represents a policy explicitly as a finite-state controller and iteratively improves the controller by search in policy space.  ...  Thanks to Shlomo Zilberstein and an anonymous re viewer for helpful comments and to To ny Cassandra and Milos Hauskrecht for making available their test problems.  ... 
arXiv:1301.7380v1 fatcat:kfpp7ml6ovgvnaqwtrewjfbd5m

Coverage Analysis for Embedded Testing and an Application [chapter]

Jinsong Zhu, Son T. Vuong
1999 IFIP Advances in Information and Communication Technology  
In this paper, we present two new results on the properties of the coverage measure for embedded testing as proposed in [10] , and an application of the measure to a practical protocol.  ...  Then we prove that the calculation of the coverage measure is NP-complete, which indicates that there unlikely exist efficient algorithms to compute the coverage in general.  ...  In our study, we describe each module in a composite system as a finite state machine (FSM), and the composite system as a system of communicating finite state machines (CFSMs).  ... 
doi:10.1007/978-0-387-35578-8_21 fatcat:nejekrahhrbvzp2g2jpwiggtau

Fast eigenvalue algorithm for central potentials

R E Crandall
1983 Journal of Physics A: Mathematical and General  
An algorithm is described that seeks out Schrodinger eigenvalues EnI for a given central potential V ( r ) . The algorithm has, in principle, arbitrary precision.  ...  The method is tested on the central Gaussian potential V ( r ) = -A exp(-Ar') of recent interest.  ...  computation when a test E is not a bound state value.  ... 
doi:10.1088/0305-4470/16/12/001 fatcat:k6lyclqoyffkvpin5ziy4lalum

Effective storage capacity of labeled graphs

Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod
2014 Information and Computation  
Specifically, we are interested in the effective capacity of members of some class of graphs, the number of states distinguishable by a Turing machine that uses the labeled graph itself in place of the  ...  It equals the information-theoretic capacity of the graph up to constant factors for trees, random graphs with polynomial edge probabilities, and bounded-degree graphs.  ...  Acknowledgments The authors would like to thank Yinghua Wu for many useful discussions during the early stages of this work.  ... 
doi:10.1016/j.ic.2013.11.004 fatcat:fmnemau52raxbcqrihddkwtzx4

Counter Machines: Decidable Properties and Applications to Verification Problems [chapter]

Oscar H. Ibarra, Jianwen Su, Zhe Dang, Tevfik Bultan, Richard Kemmerer
2000 Lecture Notes in Computer Science  
Finally, we state that Theorems 4 and 5 can be generalized: Theorem 11.  ...  Then the results of Theorems 8-10 hold for reversal-bounded machines (which are not necessarily strongly reversal-bounded) that use such restricted linear relations.  ...  Let Å be a nondeterministic reversal-bounded -counter machine with state set ½ ¾ × for some ×. Each counter can be incremented by integer constants (· ¼) and can be tested if to integer constants.  ... 
doi:10.1007/3-540-44612-5_38 fatcat:ikuhf337xreubdgbs2vxef5hey

FSM Based Interoperability Testing Methods for Multi Stimuli Model [chapter]

Khaled El-Fakih, Vadim Trenkaev, Natalia Spitsyna, Nina Yevtushenko
2004 Lecture Notes in Computer Science  
In this paper, we propose two fault models and methods for the derivation of interoperability test suites when the system implementation is given in the form of two deterministic communicating finite state  ...  machines.  ...  The authors would like to thank Rita Dorofeeva at Tomsk State University for implementing and experimenting with the incremental testing methods.  ... 
doi:10.1007/978-3-540-24704-3_5 fatcat:bmdrla63vfcilcd32l5orweq5i

A Formal Approach to Verify Parameterized Protocols in Mobile Cyber-Physical Systems

Long Zhang, Wenyan Hu, Wanxia Qu, Yang Guo, Sikun Li
2017 Mobile Information Systems  
Then, a novel algorithm, which uses IC3 (the state-of-the-art model checking algorithm) as the back-end engine, is presented to verify the Petri net model.  ...  In addition to solving the instances fast, our method is significant for its lower memory consumption.  ...  The authors thank Carl Kwan for helpful and detailed comments and suggestions.  ... 
doi:10.1155/2017/5731678 fatcat:r7co6hiqt5fglhbuzx7ubjfbnm

A theory of compaction-based parallelization

Alexander Aiken
1990 Theoretical Computer Science  
pipelining in the presence of tests.  ...  Using the primitive transformations and the limit-taking transformation, it is possible to express the classical parallelization techniques for vector, multiprocessor, and VLIW machines.  ...  In .22, the compaction algorithm computes m to arbitrary precision, so it is not a finite-state compaction algorithm. unbounded compaction algorithm also has unbounded state: no finite-state machine can  ... 
doi:10.1016/0304-3975(90)90143-6 fatcat:cdkghu35urds7lyqedzra2dcmi

A Lower Bound for the Optimization of Finite Sums [article]

Alekh Agarwal, Leon Bottou
2015 arXiv   pre-print
This paper presents a lower bound for optimizing a finite sum of n functions, where each function is L-smooth and the sum is μ-strongly convex.  ...  The conclusion we draw is that a lot of caution is necessary for an accurate comparison, and identify machine learning scenarios where the new methods help computationally.  ...  We also thank the anonymous reviewer who pointed out that the dual coordinate are not valid IFO algorithms.  ... 
arXiv:1410.0723v4 fatcat:352cw5wfknc53asldkjztrw6za

A guided incremental test case generation procedure for conformance testing for CEFSM specified protocols [chapter]

C. Bourhfir, R. Dssouli, E. Aboulhamid, N. Rico
1998 Testing of Communicating Systems  
This paper presents an incremental method for automatic executable test case and test sequence generation for a protocol modeled as communicating extended finite state machines (CEFSMs) with asynchronous  ...  are influenced by) C, and generating test cases for it.  ...  AN EFSM TEST CASE GENERATION ALGORITHM The algorithm EFTG (Extended Finite state machine Test Generator) presented in [Bourhfir 1997 ] generates executable test cases for EFSM specified protocols which  ... 
doi:10.1007/978-0-387-35381-4_17 fatcat:cw7sgczxg5apnmnfzhkedwopp4

Quantum circuit design for universal distribution using a superposition of classical automata [article]

Aritra Sarkar, Zaid Al-Ars, Koen Bertels
2022 arXiv   pre-print
This circuit is able to accelerate the inference of algorithmic structures in data for discovering causal generative models.  ...  In this research, we present a quantum circuit design and implementation for a parallel universal linear bounded automata.  ...  A finite state machine (FSM) is a mathematical model of computation that can be in exactly one of a finite number of states at any given time.  ... 
arXiv:2006.00987v2 fatcat:ga7lgbhrdnctnecg3oayhi367a

Reachability Analysis for Some Models of Infinite-State Transition Systems [chapter]

Oscar H. Ibarra, Tevfik Bultan, Jianwen Su
2000 Lecture Notes in Computer Science  
The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augmented with finitely many reversal-bounded counters (i.e. each counter can be incremented or  ...  decremented by 1 and tested for zero, but the number of times it can change mode from nondecreasing to nonincreasing and vice-versa is bounded by a constant, independent of the computation).  ...  We would also like to investigate the complexity of verification procedures for these infinite-state models.  ... 
doi:10.1007/3-540-44618-4_15 fatcat:fyws5qzlkrbqreoekyxxjj3qxu
« Previous Showing results 1 — 15 out of 36,790 results