Sökning: "counter automaton"
Hittade 3 avhandlingar innehållade orden counter automaton.
1. Constraints for Membership in Formal Languages under Systematic Search and Stochastic Local Search
Sammanfattning : This thesis focuses on constraints for membership in formal languages under both the systematic search and stochastic local search approaches to constraint programming (CP). Such constraints are very useful in CP for the following three reasons: They provide a powerful tool for user-level extensibility of CP languages. LÄS MER
2. Infinite Structures in Timed Systems
Sammanfattning : Real time systems distinguish themselves by explicitly stating timing constraints in the system specification. This requires specific methods and tools in system design to ensure such constraints. We focus on one of the methods applied in the validation phase, namely formal verification. LÄS MER
3. On Solving String Constraints
Sammanfattning : Software systems are deeply involved in diverse human activities as everyone uses a variety of software systems on a daily basis. It is essential to guarantee that software systems all work correctly. Two popular methods for finding failures of software systems are testing and model checking. LÄS MER