Removing Irrelevant Atomic Formulas for Checking Timed Automata Efficiently
Lecture notes in computer science2004pp. 34–45
Citations Over TimeTop 22% of 2004 papers
Related Papers
- → SimpleCAR: An Efficient Bug-Finding Tool Based on Approximate Reachability(2018)17 cited
- → The complexity of reachability in distributed communicating processes(1988)19 cited
- → Recent Advances on Reachability Problems for Valence Systems (Invited Talk)(2021)2 cited
- → The complexity of reachability in distributed communicating processes(1988)2 cited
- → Unfolding Based Algorithms for the Reachability Problem(2001)