Andrea Turrini

According to our database1, Andrea Turrini authored at least 33 papers between 2005 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
ROLL 1.0: \omega -Regular Language Learning Library.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019

2018
The quest for minimal quotients for probabilistic and Markov automata.
Inf. Comput., 2018

Learning to Complement Büchi Automata.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2018

Learning Büchi Automata and Its Applications.
Proceedings of the Engineering Trustworthy Software Systems - 4th International School, 2018

Advanced automata-based algorithms for program termination checking.
Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2018

Model Checking Probabilistic Epistemic Logic for Probabilistic Multiagent Systems.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017
Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2017

JANI: Quantitative Model and Tool Interaction.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Polynomial-Time Alternating Probabilistic Bisimulation for Interval MDPs.
Proceedings of the Dependable Software Engineering. Theories, Tools, and Applications, 2017

Multi-objective Robust Strategy Synthesis for Interval Markov Decision Processes.
Proceedings of the Quantitative Evaluation of Systems - 14th International Conference, 2017

Model Checking Omega-regular Properties for Quantum Markov Chains .
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016
Deciding probabilistic automata weak bisimulation: theory and practice.
Formal Asp. Comput., 2016

An Efficient Synthesis Algorithm for Parametric Markov Chains Against Linear Time Properties.
Proceedings of the Dependable Software Engineering: Theories, Tools, and Applications, 2016

Exploiting Robust Optimization for Interval Probabilistic Bisimulation.
Proceedings of the Quantitative Evaluation of Systems - 13th International Conference, 2016

Compositional Bisimulation Minimization for Interval Markov Decision Processes.
Proceedings of the Language and Automata Theory and Applications, 2016

A Simple Algorithm for Solving Qualitative Probabilistic Parity Games.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015
Polynomial time decision algorithms for probabilistic automata.
Inf. Comput., 2015

A Comparative Study of BDD Packages for Probabilistic Symbolic Model Checking.
Proceedings of the Dependable Software Engineering: Theories, Tools, and Applications, 2015

QPMC: A Model Checker for Quantum Programs and Protocols.
Proceedings of the FM 2015: Formal Methods, 2015

Lazy Probabilistic Model Checking without Determinisation.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

Preference Planning for Markov Decision Processes.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Cost Preserving Bisimulations for Probabilistic Automata.
Logical Methods in Computer Science, 2014

iscasMc: A Web-Based Probabilistic Model Checker.
Proceedings of the FM 2014: Formal Methods, 2014

2013
On the Efficiency of Deciding Probabilistic Automata Weak Bisimulation.
ECEASST, 2013

The Quest for Minimal Quotients for Probabilistic Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

Deciding Bisimilarities on Distributions.
Proceedings of the Quantitative Evaluation of Systems - 10th International Conference, 2013

Cost Preserving Bisimulations for Probabilistic Automata.
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

2012
Computing Behavioral Relations for Probabilistic Concurrent Systems.
Proceedings of the Stochastic Model Checking. Rigorous Dependability Analysis Using Model Checking Techniques for Stochastic Systems, 2012

Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2010
Conditional Automata: A Tool for Safe Removal of Negligible Events.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009
A quantitative doxastic logic for probabilistic processes and applications to information-hiding.
Journal of Applied Non-Classical Logics, 2009

2007
Approximated Computationally Bounded Simulation Relations for Probabilistic Automata.
Proceedings of the 20th IEEE Computer Security Foundations Symposium, 2007

2005
Comparative Analysis of Bisimulation Relations on Alternating and Non-Alternating Probabilistic Models.
Proceedings of the Second International Conference on the Quantitative Evaluaiton of Systems (QEST 2005), 2005


  Loading...