I/O automata based verification of finite state distributed systems: complexity issues
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
On the complexity of verifying concurrent transition systems
Information and Computation
Architecture-driven verification of concurrent systems
Nordic Journal of Computing
Analysis Problems for Sequential Dynamical Systems and Communicating State Machines
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Towards a Predictive Computational Complexity Theory
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Alphabet-Based Synchronisation is Exponentially Cheaper
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Reachability problems for sequential dynamical systems with threshold functions
Theoretical Computer Science - Mathematical foundations of computer science
Complexity of reachability problems for finite discrete dynamical systems
Journal of Computer and System Sciences
Predecessor existence problems for finite discrete dynamical systems
Theoretical Computer Science
Information Processing Letters
Hardness of preorder checking for basic formalisms
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Hardness of preorder checking for basic formalisms
Theoretical Computer Science
On the expressiveness of refinement settings
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
| Hi-index | 0.00 |