Výsledky vyhledávání - "Model checking algorithm"

Reasoning with a Bounded Number of Resources in ATL+

Autoři: Belardinelli, Francesco Demri, Stéphane Imperial College London a další

Přispěvatelé: Belardinelli, Francesco Demri, Stéphane Imperial College London a další

Zdroj: 24th European Conference on Artificial Intelligence
https://hal.archives-ouvertes.fr/hal-03005853
24th European Conference on Artificial Intelligence, Aug 2020, Santiago de Compostela, Spain. pp.624--631, ⟨10.3233/FAIA200147⟩

Témata: alternating vector addition system (AVASS), bounded number of resources, model-checking, one resource, resource-bounded concurrent game structure, alternating-time temporal logic ATL, alternating-time temporal logic ATL+, resource, translation, model-checking algorithm, 2EXPTIME, complexity, vector addition system (VAS), [INFO]Computer Science [cs], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]

Geografické téma: Santiago de Compostela, Spain

Relation: hal-03005853; https://hal.archives-ouvertes.fr/hal-03005853; https://hal.archives-ouvertes.fr/hal-03005853/document; https://hal.archives-ouvertes.fr/hal-03005853/file/BD-ECAI2020.pdf

Dostupnost: https://hal.archives-ouvertes.fr/hal-03005853
https://hal.archives-ouvertes.fr/hal-03005853/document
https://hal.archives-ouvertes.fr/hal-03005853/file/BD-ECAI2020.pdf
https://doi.org/10.3233/FAIA200147

An efficient TCTL model checking algorithm and a reduction technique for verification of timed actor models

Autoři: Khamespanah, E. Khosravi, R. Sirjani, Marjan

Zdroj: Science of Computer Programming. 153:1-29

Témata: Actor model, Durational transition graph, Model checking, TCTL, Timed Rebeca, Computational complexity, Interactive computer systems, Modeling languages, Polynomial approximation, Real time systems, Semantics, Actor models, Model checking algorithm, Polynomial-time algorithms, Reduction techniques, Timed transition systems, Transition graphs

Popis souboru: print

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-38161

A Modal Logic for π-Calculus and Model Checking Algorithm

Autoři: Tingting Han Taolue Chen Jian Lu

Zdroj: Electronic Notes in Theoretical Computer Science. 123:19-33

Témata: π-calculus, Symbolic Transition Graph, 0202 electrical engineering, electronic engineering, information engineering, π-μ-logic, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Model Checking Algorithm, Theoretical Computer Science, Computer Science(all)

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/entcs/entcs123.html#ChenHL05
https://core.ac.uk/display/82618529
https://www.sciencedirect.com/science/article/abs/pii/S1571066105000459
https://www.cs.ox.ac.uk/people/taolue.chen/pub-papers/Wollic04.pdf
http://www.eis.mdx.ac.uk/staffpages/taoluechen/pub-papers/Wollic04.pdf
https://cyberleninka.org/article/n/7276

Model checking and boolean graphs

Autoři: Henrik Reif Andersen

Zdroj: Lecture Notes in Computer Science ISBN: 9783540552536

Témata: modal \(\mu\)-calculus, Analysis of algorithms and problem complexity, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science, Graph theory (including graph drawing) in computer science, Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), 0202 electrical engineering, electronic engineering, information engineering, marking of a Boolean graph, model checking algorithm, Modal logic (including the logic of norms), satisfaction problem, Computer Science(all)

Popis souboru: application/xml

Přístupová URL adresa: https://link.springer.com/content/pdf/10.1007%2F3-540-55253-7_1.pdf
https://dblp.uni-trier.de/db/journals/tcs/tcs126.html#Andersen94
https://www.sciencedirect.com/science/article/pii/0304397594902666
https://core.ac.uk/display/82568716
https://dblp.uni-trier.de/db/conf/esop/esop92.html#Andersen92
https://link.springer.com/chapter/10.1007/3-540-55253-7_1
https://link.springer.com/content/pdf/10.1007%2F3-540-55253-7_1.pdf
https://doi.org/10.1007/3-540-55253-7_1
https://rd.springer.com/chapter/10.1007/3-540-55253-7_1
https://link.springer.com/10.1007/3-540-55253-7_1

Model checking well-behaved fragments of HS: The (almost) final picture

Autoři: MOLINARI, ALBERTO MONTANARI, Angelo Peron, Adriano a další

Přispěvatelé: MOLINARI, ALBERTO MONTANARI, Angelo Peron, Adriano a další

Témata: Temporal logic Interval temporal logic, Knowledge representation, System verifications, Model checker, Model checking algorithm, Model checking problem, Point-based, Model Checking, Interval Temporal Logics, Computational Complexity, Model checking Interval Temporal Logic Computational Complexity

Popis souboru: application/pdf

Přístupová URL adresa: http://hdl.handle.net/11588/669741
http://hdl.handle.net/11368/3029556
https://hdl.handle.net/11562/971068
https://hdl.handle.net/11390/1089181
https://hdl.handle.net/11368/3029556
https://hdl.handle.net/11588/669741

Reasoning tractably about explicit belief: A model-theoretic approach

Autoři: Kwang Mong Sim

Zdroj: International Journal of Intelligent Systems. 15:811-848

Témata: intelligent agents, Knowledge representation, implicit belief, decidability, explicit belief, Logics of knowledge and belief (including belief change), multivalued epistemic logic, model-checking algorithm

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1517022
https://doi.org/10.1002/1098-111x(200009)15:9<811::aid-int1>3.0.co;2-b
https://dblp.uni-trier.de/db/journals/ijis/ijis15.html#Sim00

Symbolic model checking: 1020 States and beyond: Symbolic model checking: \(10^{20}\) states and beyond

Autoři: David L. Dill Jerry R. Burch L.J. Hwang a další

Zdroj: Information and Computation. 98:142-170

Témata: FOS: Computer and information sciences, Specification and verification (program logics, model checking, etc.), observational equivalence, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), 0102 computer and information sciences, 02 engineering and technology, propositional linear temporal logic, 01 natural sciences, Theoretical Computer Science, Computer Science Applications, mu-calculus, Computational Theory and Mathematics, Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), binary decision diagrams, computation tree logic, symbolic representation, 0202 electrical engineering, electronic engineering, information engineering, 89999 Information and Computing Sciences not elsewhere classified, model checking algorithm, finite-state systems, Information Systems

Popis souboru: application/xml

Formal Performability Evaluation of Architectural Models of Critical Infrastructures

Autoři: Haverkort, Boudewijn R. Remke, Anne Roolvink, Stephan a další

Přispěvatelé: Haverkort, Boudewijn R. Remke, Anne Roolvink, Stephan a další

Témata: Semantic Model, Datatypes, Model checking, Performability evaluation, Input/output automata, Random processes, Model checking algorithm, Stochastic logic, Description languages, Reliability, Specification languages, Semantics, Architectural models, Markovian, Application examples, CR-B.1.3, Arches

Popis souboru: application/pdf

Přístupová URL adresa: https://research.utwente.nl/en/publications/51ba8166-b1f4-4422-975b-f55791092ba2
https://resolver.tno.nl/uuid:a12887f0-ac9c-414b-97d5-a119aea2be8c
http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-128408

Local model checking for context-free processes

Autoři: Bernhard Steffen Hardi Hungar

Zdroj: Lecture Notes in Computer Science ISBN: 9783540569398

Témata: context-free process, Specification and verification (program logics, model checking, etc.), local model checking algorithm, Theorem proving (deduction, resolution, etc.)

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/751138
https://link.springer.com/chapter/10.1007/3-540-56939-1_105
https://doi.org/10.1007/3-540-56939-1_105
https://dblp.uni-trier.de/db/conf/icalp/icalp93.html#HungarS93
https://rd.springer.com/chapter/10.1007/3-540-56939-1_105

Model checking well-behaved fragments of HS: The (almost) final picture

Autoři: Alberto Molinari Angelo Montanari Pietro Sala a další

Přispěvatelé: Alberto Molinari Angelo Montanari Pietro Sala a další

Témata: Knowledge representation, Temporal logic Interval temporal logic, Model checker, Model checking algorithm, Model checking problem, Point-based, System verifications

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000492378700047; ispartofbook:Principles of Knowledge Representation and Reasoning: Proceedings of the 15th International Conference, KR 2016; 15th International Conference on Principles of Knowledge Representation and Reasoning, KR 2016; firstpage:473; lastpage:482; numberofpages:10; alleditors:Delgrande J.,Baral C.,Wolter F.; http://hdl.handle.net/11588/669741

Dostupnost: http://hdl.handle.net/11588/669741

Probabilistic resource failure in real-time process algebra

Autoři: Philippou, Anna Cleaveland, R. Lee, I. a další

Přispěvatelé: Philippou, Anna Cleaveland, R. Lee, I. a další

Zdroj: 9th International Conference on Concurrency Theory, CONCUR 1998
Lect. Notes Comput. Sci.

Témata: Probabilistic analysis, Model checking, Interactive computer systems, Algebra, Probability of failure, Probabilistic variant, Real-time process algebra, Real time systems, Model checking algorithm, Hennessy-Milner Logics, Specifications, Probabilistic constraints, Probabilistic extension

Přístupová URL adresa: http://gnosis.library.ucy.ac.cy/handle/7/54838

A really temporal logic

Autoři: Rajeev Alur Thomas A. Henzinger

Zdroj: 30th Annual Symposium on Foundations of Computer Science. :164-169

Témata: Logic in computer science, Specification and verification (program logics, model checking, etc.), real-time systems, temporal logic, tableau-based decision procedure, 0202 electrical engineering, electronic engineering, information engineering, freeze quantifier, 0102 computer and information sciences, 02 engineering and technology, model-checking algorithm, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: http://ieeexplore.ieee.org/document/63473/
https://dblp.uni-trier.de/db/conf/focs/focs89.html#AlurH89
https://ieeexplore.ieee.org/document/63473/

Modal logic as a design notation

Autoři: Areces, C. Felder, M. Hirsch, D. a další

Témata: Formal logic, Inverse problems, Model checking, Specification languages, Specifications, Design notations, Inverse operators, Method of modeling, Modal models, Model checking algorithm, Property specification language, Prototype tools, Software system designs, Computer circuits

Relation: https://hdl.handle.net/20.500.12110/paper_08186843_v_n_p150_Areces

Dostupnost: https://hdl.handle.net/20.500.12110/paper_08186843_v_n_p150_Areces

LTL model checking of colored Petri nets based on net unfoldings

Autoři: Kozura, V. E.

Témata: LTL semantics, Specification and verification (program logics, model checking, etc.), net unfolding, Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), Semantics in the theory of computing, colored Petri nets, model-checking algorithm

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1822435

Modal logic as a design notation

Témata: Formal logic, Inverse problems, Model checking, Specification languages, Specifications, Design notations, Inverse operators, Method of modeling, Modal models, Model checking algorithm, Property specification language, Prototype tools, Software system designs, Computer circuits

Relation: https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_08186843_v_n_p150_Areces; https://hdl.handle.net/20.500.12110/paper_08186843_v_n_p150_Areces

Dostupnost: https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_08186843_v_n_p150_Areces
https://hdl.handle.net/20.500.12110/paper_08186843_v_n_p150_Areces