Three Case Studies on Verification of Infinite-State Systems

Keyphrases

• Timed Automata 100%
• Infinite-state Systems 100%
• Symbolic Search 100%
• Network Routing 50%
• Mechanism-based 50%
• Data Domain 50%
• Control Structure 50%
• Effective Algorithm 50%
• Petri Nets 50%
• Software System 50%
• Pushdown 50%
• Infinite number 50%
• System Expansion 50%
• Process Algebra 50%
• Reachable States 50%
• Parameter Control 50%
• Channel System 50%
• Vertical Approach 50%
• Plotter 50%
• Rewriting System 50%
• Pushdown Automata 50%
• Broadcast Protocol 50%
• Algebra System 50%
• Bounded Data 50%
• Counter Automata 50%
• Linear Cellular Automata 50%
• Skyline 50%
• Mutex 50%
• Cache Coherence Protocol 50%
• Verification Challenges 50%

Computer Science

• Case Study 100%
• Automaton 66%
• Timed Automaton 66%
• Symbolic Search 66%
• Efficient Algorithm 33%
• Data Domain 33%
• Software Systems 33%
• Control Structure 33%
• Process Algebra 33%
• Parameter Control 33%
• Pushdown Automaton 33%
• Broadcast Protocol 33%
• Cache Coherence 33%
• Experimental Result 33%
• Infinite Number 33%
• Reachable State 33%
• Petri Net 33%