| Publication | Date of Publication | Type |
|---|
A binary integer programming-based method for qubit mapping in sparse architectures
Acta Informatica | 2025-01-08 | Paper |
Behavioural pseudometrics for nondeterministic probabilistic systems
Scientific Annals of Computer Science | 2024-08-15 | Paper |
Encodability criteria for quantum based systems
Logical Methods in Computer Science | 2024-06-27 | Paper |
| Formalisation of Probabilistic Testing Semantics in Coq | 2024-03-14 | Paper |
An optimal quantum error-correcting procedure using quantifier elimination
Quantum Information Processing | 2023-03-15 | Paper |
On Equivalence Checking of Nondeterministic Finite Automata
Dependable Software Engineering. Theories, Tools, and Applications | 2022-11-04 | Paper |
An algebraic method to fidelity-based model checking over quantum Markov chains
Theoretical Computer Science | 2022-10-14 | Paper |
Encodability criteria for quantum based systems
(available as arXiv preprint) | 2022-08-19 | Paper |
Model checking QCTL plus on quantum Markov chains
Theoretical Computer Science | 2022-04-07 | Paper |
Formal semantics of a classical-quantum language
Theoretical Computer Science | 2022-04-07 | Paper |
| Verifying quantum communication protocols with ground bisimulation | 2021-10-18 | Paper |
| Bisimulations for probabilistic and quantum processes (invited paper) | 2021-08-04 | Paper |
| Qsimulation V2.0: an optimized quantum simulator | 2021-07-08 | Paper |
| Relating reasoning methodologies in linear logic and process algebra | 2021-04-27 | Paper |
Relating reasoning methodologies in linear logic and process algebra
(available as arXiv preprint) | 2021-04-27 | Paper |
| Real-reward testing for probabilistic processes (extended abstract) | 2021-03-10 | Paper |
Time-bounded termination analysis for probabilistic programs with delays
Information and Computation | 2020-12-15 | Paper |
SMT-based generation of symbolic automata
Acta Informatica | 2020-05-26 | Paper |
| Behavioural pseudometrics for nondeterministic probabilistic systems | 2018-08-16 | Paper |
Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems
Fuzzy Sets and Systems | 2018-02-21 | Paper |
Logical characterizations of simulation and bisimulation for fuzzy transition systems
Fuzzy Sets and Systems | 2018-01-22 | Paper |
Probabilistic bisimilarity as testing equivalence
Information and Computation | 2017-11-16 | Paper |
| scientific article; zbMATH DE number 6774228 (Why is no real title available?) | 2017-09-12 | Paper |
On mobility and communication
Electronic Notes in Theoretical Computer Science | 2016-08-01 | Paper |
Relating reasoning methodologies in linear logic and process algebra
Mathematical Structures in Computer Science | 2016-07-28 | Paper |
Program equivalence in linear contexts
Theoretical Computer Science | 2015-05-26 | Paper |
| Semantics of probabilistic processes. An operational approach | 2015-02-03 | Paper |
On real reward testing
Journal of Shanghai Jiaotong University (Science) | 2014-09-02 | Paper |
Symbolic bisimulation for quantum processes
ACM Transactions on Computational Logic | 2014-07-17 | Paper |
Real-reward testing for probabilistic processes
Theoretical Computer Science | 2014-06-06 | Paper |
Probabilistic barbed congruence
Electronic Notes in Theoretical Computer Science | 2014-01-17 | Paper |
Remarks on testing probabilistic processes
Electronic Notes in Theoretical Computer Science | 2013-12-06 | Paper |
Weak probabilistic anonymity
Electronic Notes in Theoretical Computer Science | 2013-12-06 | Paper |
On the semantics of Markov automata
Information and Computation | 2013-06-06 | Paper |
Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus
Formal Aspects of Computing | 2013-03-22 | Paper |
Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus
Formal Aspects of Computing | 2013-03-22 | Paper |
The buffered \(\pi\)-calculus: a model for concurrent languages
Language and Automata Theory and Applications | 2013-03-18 | Paper |
Open bisimulation for quantum processes
Lecture Notes in Computer Science | 2012-09-21 | Paper |
Compositional reasoning for Markov decision processes (extended abstract)
Fundamentals of Software Engineering | 2012-06-29 | Paper |
On the semantics of Markov automata
Automata, Languages and Programming | 2011-07-07 | Paper |
Finite axiomatization for symbolic probabilistic \(\pi \)-calculus
Journal of Shanghai Jiaotong University (Science) | 2011-01-05 | Paper |
Characterising probabilistic processes logically (extended abstract)
Logic for Programming, Artificial Intelligence, and Reasoning | 2010-10-12 | Paper |
Testing Finitary Probabilistic Processes
CONCUR 2009 - Concurrency Theory | 2009-10-22 | Paper |
| scientific article; zbMATH DE number 5605128 (Why is no real title available?) | 2009-09-19 | Paper |
Characterising Testing Preorders for Finite Probabilistic Processes
Logical Methods in Computer Science | 2009-04-29 | Paper |
Analyzing an Electronic Cash Protocol Using Applied Pi Calculus
Applied Cryptography and Network Security | 2009-03-10 | Paper |
Scalar Outcomes Suffice for Finitary Probabilistic Testing
Programming Languages and Systems | 2007-09-04 | Paper |
Axiomatizations for probabilistic finite-state behaviors
Theoretical Computer Science | 2007-04-13 | Paper |
Processes, Terms and Cycles: Steps on the Road to Infinity
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Ensuring termination by typability
Information and Computation | 2006-08-16 | Paper |
Towards an algebraic theory of typed mobile processes
Theoretical Computer Science | 2006-03-20 | Paper |
Foundations of Software Science and Computational Structures
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
| scientific article; zbMATH DE number 2163050 (Why is no real title available?) | 2005-04-29 | Paper |
| scientific article; zbMATH DE number 1780061 (Why is no real title available?) | 2002-08-12 | Paper |
