Checking Experiments for Finite State Machines With Symbolic Inputs

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-25945-1_1
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Checking Properties Described by State Machines: On Synergy of Instrumentation, Slicing, and Symbolic Execution

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Finite State Machines

2017English

Symbolic Step Encodings for Object Based Communicating State Machines

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Finite-State Automata on Infinite Inputs

2012English

Deriving Adaptive Distinguishing Sequences for Finite State Machines

Proceedings of the Institute for System Programming of the RAS
2018English

Model Checking Timed UML State Machines and Collaborations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Probabilistic Finite-State Machines - Part I

IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern RecognitionApplied MathematicsComputer VisionMathematicsComputational TheoryArtificial IntelligenceSoftware
2005English

Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Test Suite Minimization for Embedded Nondeterministic Finite State Machines

IFIP Advances in Information and Communication Technology
Computer NetworksInformation SystemsManagementCommunications
1999English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy