Inference and minimization of hidden Markov chains
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Probabilistic Finite-State Machines-Part I
IEEE Transactions on Pattern Analysis and Machine Intelligence
On probabilistic program equivalence and refinement
CONCUR 2005 - Concurrency Theory
Weighted path queries on semistructured databases
Information and Computation
Determining the equivalence for one-way quantum finite automata
Theoretical Computer Science
Note: A note on quantum sequential machines
Theoretical Computer Science
Hierarchy and equivalence of multi-letter quantum finite automata
Theoretical Computer Science
Mutation testing from probabilistic and stochastic finite state machines
Journal of Systems and Software
Weighted path queries on semistructured databases
Information and Computation
A survey of Markovian behavioral equivalences
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
On automated verification of probabilistic programs
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Probabilistic automata on finite words: decidable and undecidable problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Linear-time and may-testing in a probabilistic reactive setting
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Language equivalence for probabilistic automata
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Learning-based compositional verification for synchronous probabilistic systems
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Approximating Markovian testing equivalence
Theoretical Computer Science
Characterizations of one-way general quantum finite automata
Theoretical Computer Science
On the computation of some standard distances between probabilistic automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
On the complexity of computing probabilistic bisimilarity
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
On the complexity of the equivalence problem for probabilistic automata
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Deciding the Value 1 Problem for Probabilistic Leaktight Automata
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
On the complexity of minimizing probabilistic and quantum automata
Information and Computation
Approximate verification and enumeration problems
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
A probabilistic kleene theorem
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Confidentiality for probabilistic multi-threaded programs and its verification
ESSoS'13 Proceedings of the 5th international conference on Engineering Secure Software and Systems
Revisiting the equivalence problem for finite multitape automata
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Quantitative reactive modeling and verification
Computer Science - Research and Development
Quantitative Monadic Second-Order Logic
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.01 |