×

Found 71 Documents (Results 1–71)

Computation tree logic model checking over possibilistic decision processes under finite-memory scheduler. (English) Zbl 1511.68162

Cai, Zhiping (ed.) et al., Theoretical computer science. 39th national conference, NCTCS 2021, Yinchuan, China, July 23–25, 2021. Revised selected papers. Singapore: Springer. Commun. Comput. Inf. Sci. 1494, 75-88 (2021).
MSC:  68Q60 68T37
PDFBibTeX XMLCite
Full Text: DOI

Model checking branching time properties for incomplete Markov chains. (English) Zbl 07808262

Biondi, Fabrizio (ed.) et al., Model checking software. 26th international symposium, SPIN 2019, Beijing, China, July 15–16, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11636, 20-37 (2019).
MSC:  68Q60 03B70 60J20
PDFBibTeX XMLCite
Full Text: DOI

The satisfiability problem for unbounded fragments of probabilistic CTL. (English) Zbl 1520.68075

Schewe, Sven (ed.) et al., 29th international conference on concurrency theory. CONCUR 2018, Beijing, China, September 4–7, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 118, Article 32, 16 p. (2018).
MSC:  68Q60 03B70 68R07
PDFBibTeX XMLCite
Full Text: DOI arXiv

Formalizing monitoring processes for large-scale distributed systems using abstract state machines. (English) Zbl 1461.68035

Cerone, Antonio (ed.) et al., Software engineering and formal methods. SEFM 2017 collocated workshops: DataMod, FAACS, MSE, CoSim-CPS, and FOCLASA, Trento, Italy, September 4–5, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10729, 153-167 (2018).
MSC:  68M14 68M15 68Q60
PDFBibTeX XMLCite
Full Text: DOI

FlyFast: a scalable approach to probabilistic model-checking based on mean-field approximation. (English) Zbl 1498.68162

Katoen, Joost-Pieter (ed.) et al., ModelEd, testEd, trustEd. Essays dedicated to Ed Brinksma on the occasion of his 60th birthday. Cham: Springer. Lect. Notes Comput. Sci. 10500, 254-275 (2017).
MSC:  68Q60 60J20 68Q87
PDFBibTeX XMLCite
Full Text: DOI

Parallel multivariate meta-theorems. (English) Zbl 1398.68212

Guo, Jiong (ed.) et al., 11th international symposium on parameterized and exact computation (IPEC 2016), Aarhus, Denmark, August 24–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-023-1). LIPIcs – Leibniz International Proceedings in Informatics 63, Article 4, 17 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

Computation tree logic for synchronization properties. (English) Zbl 1388.68184

Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 98, 14 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Representing and reasoning with qualitative preferences. Tools and applications. (English) Zbl 1348.68009

Synthesis Lectures on Artificial Intelligence and Machine Learning 31. San Rafael, CA: Morgan & Claypool Publishers (ISBN 978-1-62705-839-1/pbk; 978-1-62705-840-7/ebook). xv, 138 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI

Fairness for infinite-state systems. (English) Zbl 1420.68122

Baier, Christel (ed.) et al., Tools and algorithms for the construction and analysis of systems. 21st international conference, TACAS 2015, held as part of the European joint conferences on theory and practice of software, ETAPS 2015, London, UK, April 11–18, 2015. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9035, 384-398 (2015).
MSC:  68Q60
PDFBibTeX XMLCite
Full Text: DOI Link

Polynomial-time verification of PCTL properties of MDPs with convex uncertainties. (English) Zbl 1435.68202

Sharygina, Natasha (ed.) et al., Computer aided verification. 25th international conference, CAV 2013, Saint Petersburg, Russia, July 13–19, 2013. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8044, 527-542 (2013).
MSC:  68Q60 68Q25 68Q87
PDFBibTeX XMLCite
Full Text: DOI

A language-theoretic view of verification. (English) Zbl 1256.68119

D’Souza, Deepak (ed.) et al., Modern applications of automata theory. Dedicated to the memory of Professor Priti Shankar. Foreword by Reinhard Wilhelm. Hackensack, NJ: World Scientific; Bangalore: IISc Press (ISBN 978-981-4271-04-2/hbk; 978-981-4271-05-9/ebook). IISc Research Monographs Series 2, 149-169 (2012).
PDFBibTeX XMLCite
Full Text: DOI

Considerations about the implementation of an ATL model checker. (English) Zbl 1424.68092

Simian, Dana (ed.), Modelling and development of intelligent systems. Proceedings of the second international conference, Sibiu, Romania, September 29 – October 2, 2011. Sibiu: “Lucian Blaga” University Press. 170-179 (2011).
MSC:  68Q60 03B44
PDFBibTeX XMLCite

Branching-time model checking of one-counter processes. (English) Zbl 1230.68142

Marion, Jean-Yves (ed.) et al., STACS 2010. 27th international symposium on theoretical aspects of computer science, Nancy, France, March 4–6, 2010. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-16-3). LIPIcs – Leibniz International Proceedings in Informatics 5, 405-416, electronic only (2010).
PDFBibTeX XMLCite
Full Text: DOI Link

Completeness and complexity of multi-modal CTL. (English) Zbl 1347.03028

Areces, Carlos (ed.) et al., Proceedings of the 5th workshop on methods for modalities (M4M5 2007), Cachan, France, November 29–30, 2007. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 231, 259-275 (2009).
PDFBibTeX XMLCite
Full Text: DOI

Automata: from logics to algorithms. (English) Zbl 1234.03026

Flum, Jörg (ed.) et al., Logic and automata. History and perspectives. Dedicated to Wolfgang Thomas on the occasion of his sixtieth birthday. Amsterdam: Amsterdam University Press (ISBN 978-90-5356-576-6/pbk). Texts in Logic and Games 2, 629-736 (2008).
MSC:  03D05 68Q45 68Q60
PDFBibTeX XMLCite

Deriving non-determinism from conjunction and disjunction. (English) Zbl 1169.68521

Wang, Farn (ed.), Formal techniques for networked and distributed systems – FORTE 2005. 25th IFIP WG 6.1 international conference, Taipei, Taiwan, October 2–5, 2005. Proceedings. Berlin: Springer (ISBN 3-540-29189-X/pbk). Lecture Notes in Computer Science 3731, 351-365 (2005).
MSC:  68Q60 68Q10 68Q85
PDFBibTeX XMLCite
Full Text: DOI

Timed alternating tree automata: The automata-theoretic solution to the TCTL model checking problem. (English) Zbl 0939.03041

Wiedermann, Jiří (ed.) et al., Automata, languages and programming. 26th international colloquium, ICALP ‘99. Prague, Czech Republic, July 11-15, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1644, 281-290 (1999).
MSC:  03D05 68Q60
PDFBibTeX XMLCite

Undecidable verification problems for programs with unreliable channels. (English) Zbl 1418.68123

Abiteboul, Serge (ed.) et al., Automata, languages and programming. 21st international colloquium, ICALP ’94, Jerusalem, Israel, July 11–14, 1994. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 820, 316-327 (1994).
MSC:  68Q60 03B44 68Q85
PDFBibTeX XMLCite
Full Text: DOI

A linear-time model-checking algorithm for the alternation-free modal mu-calculus. (English) Zbl 07839220

Larsen, Kim G. (ed.) et al., Computer aided verification. 3rd international workshop, CAV ’91, Aalborg, Denmark, July 1–4, 1991. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 575, 48-58 (1992).
MSC:  68Q60
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software