the capability of being proven as having or not having a particular quality
Examples of 'decidability' in a sentence
decidability
From this we directly deduce the decidability of these games on probabilistic lossy channel systems.
Nathalie Bertrand, Philippe Schnoebelen 2013, 'Solving Stochastic Büchi Games on Infinite Arenas with a Finite Attractor', Electronic Proceedings in Theoretical Computer Sciencehttp://arxiv.org/pdf/1207.4577v4. Retrieved from DOAJ CC BY 4.0 (https://creativecommons.org/licenses/by-sa/4.0/legalcode)
Necessary and sufficient conditions of the equivalence problem decidability in such models are proposed.
R. I. Podlovchenko, A. E. Molchanov 2015, 'About Algebraic Program Models with Procedures', Modelirovanie i Analiz Informacionnyh Sistemhttps://www.mais-journal.ru/jour/article/view/60. Retrieved from DOAJ CC BY 4.0 (https://creativecommons.org/licenses/by-sa/4.0/legalcode)
We provide decidability and undecidability results on the model-checking problem forinfinite tree structures.
Alex Spelten, Wolfgang Thomas, Sarah Winter 2011, 'Trees over Infinite Structures and Path Logics with Synchronization', Electronic Proceedings in Theoretical Computer Sciencehttp://arxiv.org/pdf/1111.3107v1. Retrieved from DOAJ CC BY 4.0 (https://creativecommons.org/licenses/by-sa/4.0/legalcode)
We revisited games on recursive timed automata with time-bounded restriction in the hope of recovering decidability.
Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi 2014, 'Improved Undecidability Results for Reachability Games on Recursive Timed Automata',Electronic Proceedings in Theoretical Computer Sciencehttp://arxiv.org/pdf/1408.5968v1. Retrieved from DOAJ CC BY 4.0 (https://creativecommons.org/licenses/by-sa/4.0/legalcode)
We provide (un)decidability results of such verification problems over adaptable processes considering the spectrum of topologies/evolvability patterns introduced.
Mario Bravetti 2015, 'Towards Dynamic Updates in Service Composition', Electronic Proceedings in Theoretical Computer Sciencehttp://arxiv.org/pdf/1512.07680v1. Retrieved from DOAJ CC BY 4.0 (https://creativecommons.org/licenses/by-sa/4.0/legalcode)
We also show decidability of the testing equivalence for finite systems for which the complete model may not be known.
Sonja Georgievska, Suzana Andova 2010, 'Testing Reactive Probabilistic Processes', Electronic Proceedings in Theoretical Computer Sciencehttp://arxiv.org/pdf/1006.5100v1. Retrieved from DOAJ CC BY 4.0 (https://creativecommons.org/licenses/by-sa/4.0/legalcode)
In this unifying framework, both interpretation of the measures and decidability of the verification algorithms are discussed.
Alessandro Aldini 2010, 'Approximate Testing Equivalence Based on Time, Probability, and Observed Behavior',Electronic Proceedings in Theoretical Computer Sciencehttp://arxiv.org/pdf/1006.5094v1. Retrieved from DOAJ CC BY 4.0 (https://creativecommons.org/licenses/by-sa/4.0/legalcode)
We prove the opposite, providing results of decidability of non-interference over a representative class of infinite state systems.
Eike Best, Philippe Darondeau, Roberto Gorrieri 2011, 'On the Decidability of Non Interference over Unbounded Petri Nets', Electronic Proceedings in Theoretical Computer Sciencehttp://arxiv.org/pdf/1102.5585v1. Retrieved from DOAJ CC BY 4.0 (https://creativecommons.org/licenses/by-sa/4.0/legalcode)