Enhancing Probabilistic Model Checking with Ontologies

Probabilistic model checking (PMC) is a well-established method for the quantitative analysis of state based operational models such as Markov decision processes. Description logics (DLs) provide a well-suited formalism to describe and reason about knowledge and are used as basis for the web ontology language (OWL). We investigate how such knowledge described by DLs can be integrated into the PMC process, introducing ontology-mediated PMC. Specifically, we propose ontologized programs as a formalism that links ontologies to behaviors specified by probabilistic guarded commands, the de-facto standard input formalism for PMC tools such as Prism. Through DL reasoning, inconsistent states in the modeled system can be detected. We present three ways to resolve these inconsistencies, leading to different Markov decision process semantics. We analyze the computational complexity of checking whether an ontologized program is consistent under these semantics. Further, we present and implement a technique for the quantitative analysis of ontologized programs relying on standard DL reasoning and PMC tools. This way, we enable the application of PMC techniques to analyze knowledge-intensive systems.We evaluate our approach and implementation on amulti-server systemcase study,where different DL ontologies are used to provide specifications of different server platforms and situations the system is executed in.

[1]  Oscar Nierstrasz,et al.  Context-oriented Programming , 2008, J. Object Technol..

[2]  Bijan Parsia,et al.  The OWL Reasoner Evaluation (ORE) 2015 Competition Report , 2017, Journal of Automated Reasoning.

[3]  Ian Horrocks,et al.  Module Extraction in Expressive Ontology Languages via Datalog Reasoning , 2016, J. Artif. Intell. Res..

[4]  Boris Motik,et al.  HermiT: An OWL 2 Reasoner , 2014, Journal of Automated Reasoning.

[5]  Ian Horrocks,et al.  A Basic Description Logic , 2017 .

[6]  Magdalena Ortiz,et al.  Ontology-Mediated Query Answering with Data-Tractable Description Logics , 2015, Reasoning Web.

[7]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[8]  Stefan Schlobach,et al.  Non-Standard Reasoning Services for the Debugging of Description Logic Terminologies , 2003, IJCAI.

[9]  Christel Baier,et al.  Energy-Utility Quantiles , 2014, NASA Formal Methods.

[10]  Marta Z. Kwiatkowska,et al.  Automated Verification Techniques for Probabilistic Systems , 2011, SFM.

[11]  Anni-Yasmin Turhan,et al.  Give Inconsistency a Chance: Semantics for Ontology-Mediated Verification , 2020, Description Logics.

[12]  Diego Calvanese,et al.  Description Logic Knowledge and Action Bases , 2014, J. Artif. Intell. Res..

[13]  Christel Baier,et al.  Principles of model checking , 2008 .

[14]  Annabelle McIver,et al.  Probabilistic Models for the Guarded Command Language , 1997, Sci. Comput. Program..

[15]  Sean Bechhofer,et al.  The OWL API: A Java API for OWL ontologies , 2011, Semantic Web.

[16]  Rafael Peñaloza,et al.  Pinpointing in the Description Logic EL , 2007, Description Logics.

[17]  Ian Horrocks,et al.  The Even More Irresistible SROIQ , 2006, KR.

[18]  Klaus Schild,et al.  A Correspondence Theory for Terminological Logics: Preliminary Report , 1991, IJCAI.

[19]  Christel Baier,et al.  Probabilistic Model Checking and Non-standard Multi-objective Reasoning , 2014, FASE.

[20]  Uwe Aßmann,et al.  A combined formal model for relational context-dependent roles , 2015, SLE.

[21]  Jens Claßen,et al.  Verification of Knowledge-Based Programs over Description Logic Actions , 2015, IJCAI.

[22]  Instance-Based Non-standard Inferences in EL with Subjective Probabilities , 2012 .

[23]  Franz Baader,et al.  Verification of Golog Programs over Description Logic Actions , 2013, FroCos.

[24]  Ian Horrocks,et al.  An Introduction to Description Logic by Franz Baader , 2017 .

[25]  Franz Baader,et al.  Using Ontologies to Query Probabilistic Numerical Data , 2017, FroCoS.

[26]  Marta Z. Kwiatkowska,et al.  PRISM 4.0: Verification of Probabilistic Real-Time Systems , 2011, CAV.

[27]  Christel Baier,et al.  ProFeat: feature-oriented engineering for family-based probabilistic model checking , 2017, Formal Aspects of Computing.

[28]  Ian Horrocks,et al.  An Introduction to Description Logic , 2017 .

[29]  Diego Calvanese,et al.  Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family , 2007, Journal of Automated Reasoning.

[30]  Sebastian Junges,et al.  A Storm is Coming: A Modern Probabilistic Model Checker , 2017, CAV.

[31]  Robert K. Brayton,et al.  Logic Minimization Algorithms for VLSI Synthesis , 1984, The Kluwer International Series in Engineering and Computer Science.

[32]  Diego Calvanese,et al.  Linking Data to Ontologies , 2008, J. Data Semant..

[33]  Bernardo Cuenca Grau,et al.  OWL 2 Web Ontology Language: Profiles , 2009 .

[34]  Birte Glimm,et al.  Konclude: System description , 2014, J. Web Semant..

[35]  Christel Baier,et al.  From features to roles , 2020, SPLC.

[36]  Christel Baier,et al.  Modeling Role-Based Systems with Exogenous Coordination , 2016, Theory and Practice of Formal Methods.

[37]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[38]  Anni-Yasmin Turhan,et al.  Ontology-Mediated Probabilistic Model Checking , 2019, IFM.

[39]  Frédéric Boniol,et al.  Improving Model Checking with Context Modelling , 2012, Adv. Softw. Eng..

[40]  Christel Baier,et al.  Probabilistic Model Checking for Feature-Oriented Systems , 2015, LNCS Trans. Aspect Oriented Softw. Dev..

[41]  Franz Baader,et al.  Pushing the EL Envelope , 2005, IJCAI.

[42]  Carsten Lutz,et al.  Probabilistic Description Logics for Subjective Uncertainty , 2010, KR.

[43]  Yarden Katz,et al.  Pellet: A practical OWL-DL reasoner , 2007, J. Web Semant..

[44]  Carsten Lutz,et al.  Inverse Roles Make Conjunctive Queries Hard , 2007, Description Logics.

[45]  Rafael Peñaloza,et al.  Instance-Based Non-standard Inferences in $\mathcal{EL}$ with Subjective Probabilities , 2013, URSW.

[46]  Christel Baier,et al.  Energy-Utility Analysis of Probabilistic Systems with Exogenous Coordination , 2018, It's All About Coordination.

[47]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[48]  Sebastian Rudolph,et al.  Nominals, Inverses, Counting, and Conjunctive Queries or: Why Infinity is your Friend! , 2010, J. Artif. Intell. Res..

[49]  Markus Krötzsch,et al.  The Incredible ELK , 2013, Journal of Automated Reasoning.

[50]  David Parker,et al.  Symbolic Representations and Analysis of Large Probabilistic Systems , 2004, Validation of Stochastic Systems.

[51]  Christel Baier,et al.  Advances in probabilistic model checking with PRISM: variable reordering, quantiles and weak deterministic Büchi automata , 2018, International Journal on Software Tools for Technology Transfer.

[52]  Michael Nieke,et al.  Context Aware Reconfiguration in Software Product Lines , 2016, VaMoS.

[53]  Matthew Horridge,et al.  Justification based explanation in ontologies , 2012 .

[54]  Sebastian Brandt,et al.  Polynomial Time Reasoning in a Description Logic with Existential Restrictions, GCI Axioms, and - What Else? , 2004, ECAI.

[55]  Franz Baader,et al.  A Scheme for Integrating Concrete Domains into Concept Languages , 1991, IJCAI.

[56]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[57]  Stephan Tobies,et al.  Complexity results and practical algorithms for logics in knowledge representation , 2001, ArXiv.

[58]  Diego Calvanese,et al.  Actions and Programs over Description Logic Knowledge Bases: A Functional Approach , 2011 .

[59]  Markus Krötzsch,et al.  The Incredible ELK - From Polynomial Procedures to Efficient Reasoning with ℰℒ Ontologies , 2014, J. Autom. Reason..

[60]  Moshe Y. Vardi Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[61]  Yevgeny Kazakov,et al.  RIQ and SROIQ Are Harder than SHOIQ , 2008, KR.

[62]  Magdalena Ortiz,et al.  Closed Predicates in Description Logics: Results on Combined Complexity , 2016, AMW.

[63]  Bijan Parsia,et al.  Finding All Justifications of OWL DL Entailments , 2007, ISWC/ASWC.