Counter machines and verification Problems
Theoretical Computer Science
Augmenting the discrete timed automaton with other data structures
Theoretical Computer Science
Conter Machines: Decidable Properties and Applications to Verification Problems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
On Removing the Pushdown Stack in Reachability Constructions
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On Presburger Liveness of Discrete Timed Automata
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Reachability Analysis for Some Models of Infinite-State Transition Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Reachability and Safety in Queue Systems
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Generalizing the Discrete Timed Automaton
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Generalized discrete timed automata: decidable approximations for safety verification
Theoretical Computer Science - Computing and combinatorics
Verification in loosely synchronous queue-connected discrete timed automata
Theoretical Computer Science
Presburger liveness verification of discrete timed automata
Theoretical Computer Science
Eliminating the storage tape in reachability constructions
Theoretical Computer Science
Pushdown timed automata: a binary reachability characterization and safety verification
Theoretical Computer Science
Past pushdown timed automata and safety verification
Theoretical Computer Science - Implementation and application automata
Linear reachability problems and minimal solutions to linear Diophantine equation systems
Theoretical Computer Science - Implementation and application of automata
On composition and lookahead delegation of e-services modeled by automata
Theoretical Computer Science
Durations and parametric model-checking in timed automata
ACM Transactions on Computational Logic (TOCL)
Reachability in Timed Counter Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Safety verification for two-way finite automata with monotonic counters
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Automatic verification of multi-queue discrete timed automata
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
On intersection problems for polynomially generated sets
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Adding monotonic counters to automata and transition graphs
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Composability of infinite-state activity automata
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Real-Counter automata and their decision problems
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Symbolic model checking of finite precision timed automata
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Algorithmic metatheorems for decidable LTL model checking over infinite systems
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
The minimal cost reachability problem in priced timed pushdown systems
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Towards efficient MUS extraction
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Synchronisation- and reversal-bounded analysis of multithreaded programs with counters
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Similarity in languages and programs
Theoretical Computer Science
| Hi-index | 0.01 |