Filters








3,758 Hits in 3.7 sec

Analysis of Boolean Programs [chapter]

Patrice Godefroid, Mihalis Yannakakis
<span title="">2013</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
, and CTL* model checking.  ...  and CTL* model checking.  ...  Sketch: Given a deterministic multi-exit RSM A we show how to construct in linear time an equivalent single-exit RSM A", and then we use the linear-time algorithm for CTL model checking of single-exit  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-36742-7_16">doi:10.1007/978-3-642-36742-7_16</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vdppbznafzcoriitw235mwqt2q">fatcat:vdppbznafzcoriitw235mwqt2q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20131022035019/http://research.microsoft.com:80/en-us/um/people/pg/public_psfiles/tacas2013.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/30/52/3052b06a09dd49f5689b8a12b71612f055665953.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-36742-7_16"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Formal Specification and Automatic Verification of Conditional Commitments

Warda El Kholy, Mohamed El Menshawy, Jamal Bentahar, Hongyang Qu, Rachida Dssouli
<span title="">2015</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3vh5mzjvind2vk5qmq5bpyxhqa" style="color: black;">IEEE Intelligent Systems</a> </i> &nbsp;
Developing and implementing a model-checker dedicated to conditional commitment logic with user interface are urgent requirements for determining whether agents comply with their commitments protocols.  ...  Acknowledgments We thank NSERC (Canada), FQRSC (Quebec), Menofia University (Egypt), and EPSRC project EP/J011894/2 (UK) for their financial support.  ...  Symbolic Algorithm for CTL cf In the algorithmic part of our framework, we develop a new symbolic algorithm to directly address the problem of model-checking CTL cf , where the set  of states satisfying  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/mis.2015.6">doi:10.1109/mis.2015.6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ztvrsazw6zdqdbtvzliixnopke">fatcat:ztvrsazw6zdqdbtvzliixnopke</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180719082827/http://eprints.whiterose.ac.uk/85899/17/IEEE-INTS-2015.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c0/59/c059acbe72979448db8917c17d7d1d0bbddd8429.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/mis.2015.6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

An automata-theoretic approach to branching-time model checking (Extended abstract) [chapter]

Orna Bernholtz, Moshe Y. Vardi, Pierre Wolper
<span title="">1994</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing linear-time model-checking, and for obtaining many extensions and improvements to this verification  ...  ., can they be used to obtain optimal decision procedures, but, as we show here, they also make it possible to derive optimal model-checking algorithms.  ...  We prove that their l-letter nonemptiness is decidable in linear running time, which yields an automata-based model checking algorithm of linear running time for CTL.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-58179-0_50">doi:10.1007/3-540-58179-0_50</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uwvhl43uvjht3ok7epblznjduy">fatcat:uwvhl43uvjht3ok7epblznjduy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200324192551/https://rd.springer.com/content/pdf/10.1007%2F3-540-58179-0_50.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/53/f2/53f2d33c4b8cac942abd51b09fba3c2e909db771.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-58179-0_50"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Formalizing Group and Propagated Trust in Multi-Agent Systems

Nagat Drawel, Jamal Bentahar, Amine Laarej, Gaith Rjoub
<span title="">2020</span> <i title="International Joint Conferences on Artificial Intelligence Organization"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vfwwmrihanevtjbbkti2kc3nke" style="color: black;">Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence</a> </i> &nbsp;
We analyze the satisfiability and model checking problems of this logic using a reduction technique.  ...  We present a formal framework that allows individual and group of agents to reason about their trust toward other agents.  ...  BT can be reduced to CTL, and it is known from [Clarke et al., 1999] that CTL model checking can be done in a linear time with respect to the size of the CTL model and formula, i.e., O(|f (M b )| × |  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.24963/ijcai.2020/9">doi:10.24963/ijcai.2020/9</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/ijcai/DrawelBLR20.html">dblp:conf/ijcai/DrawelBLR20</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vmwveokdvzgtnohdbim7a7muta">fatcat:vmwveokdvzgtnohdbim7a7muta</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201104185548/https://www.ijcai.org/Proceedings/2020/0009.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c1/ba/c1ba531008c67e634d5f11b1678dfbfc74e303a1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.24963/ijcai.2020/9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Detecting temporal logic predicates on the happened-before model

A. Sen, V. K. Garg
<span title="">2002</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/t3x4vqewrncrfgn2wu7cafsbsq" style="color: black;">Proceedings 16th International Parallel and Distributed Processing Symposium</a> </i> &nbsp;
We also present polynomial-time algorithms for a CTL operator called until , for which such algorithms did not exist.  ...  We use a temporal logic, CTL, for specifying properties of a distributed computation and interpret it on a finite lattice of global states.  ...  Our work is different from model checking [8, 14] , which checks that a predicate is satisfied for all computations of a program.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ipdps.2002.1015583">doi:10.1109/ipdps.2002.1015583</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/ipps/SenG02.html">dblp:conf/ipps/SenG02</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/326idkovgvbm3etxfjwj7dv3w4">fatcat:326idkovgvbm3etxfjwj7dv3w4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070418154858/http://users.ece.utexas.edu/~garg/dist/ipdps02.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fb/8a/fb8ac6d83a662edcfd2ed85a1c0ac6a13b0df1e2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ipdps.2002.1015583"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Local Model Checking of Weighted CTL with Upper-Bound Constraints [chapter]

Jonas Finnemann Jensen, Kim Guldstrand Larsen, Jiří Srba, Lars Kaerlund Oestergaard
<span title="">2013</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The principal conclusion is that our local algorithm is the most efficient one with an order of magnitude improvement for model checking problems with a high number of "witnesses".  ...  We present both global and local algorithms for the fixed-point computation on symbolic dependency graphs and argue for the advantages of our approach compared to the direct encoding of the model checking  ...  As argued in [16] , both the local and global model checking algorithms run in linear time.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-39176-7_12">doi:10.1007/978-3-642-39176-7_12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/aq2jshdw6nc2dgavdiuihsigwe">fatcat:aq2jshdw6nc2dgavdiuihsigwe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922004318/http://www.cassting-project.eu/wp-content/uploads/spin2013-JLSO.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/89/dd/89dd5e5483aa4a7f9506a48d1589c42629312d4a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-39176-7_12"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Model Checking Logics of Strategic Ability: Complexity* [chapter]

N. Bulling, J. Dix, W. Jamroga
<span title="">2010</span> <i title="Springer US"> Specification and Verification of Multi-agent Systems </i> &nbsp;
This chapter is about model checking and its complexity in some of the main temporal and strategic logics, e.g. LTL, CTL, and ATL.  ...  We discuss several variants of ATL (perfect vs. imperfect recall, perfect vs. imperfect information) as well as two different measures for model checking with concurrent game structures (explicit vs. implicit  ...  As the model checking algorithm for ATL + will rely on the complexity of CTL + model checking, 6 we mention the latter result here. Theorem 5 (CTL + [38] ).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4419-6984-2_5">doi:10.1007/978-1-4419-6984-2_5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jwcrdyv7hzfw7mxz6vqfhcb4hq">fatcat:jwcrdyv7hzfw7mxz6vqfhcb4hq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811074244/http://krak.ipipan.waw.pl/~wjamroga/papers/mcheck10verificationbook.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a0/a0/a0a0f9d6c2595c73c81aba258ec35012bac5b6c9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4419-6984-2_5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

An Experiment on Parallel Model Checking of a CTL Fragment [chapter]

Rodrigo T. Saad, Silvano Dal Zilio, Bernard Berthomieu
<span title="">2012</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We propose a parallel algorithm for local, on the fly, model checking of a fragment of CTL that is well-suited for modern, multi-core architectures.  ...  One of the most novel contributions of this work is to study a space-e fficient variant for CTL model-checking that does not require to store the whole transition graph but that operates on a reverse spanning  ...  In this paper, we propose a parallel algorithm for local, on the fly, model checking of a fragment of CTL that is well-suited for modern, multi-core architectures.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-33386-6_23">doi:10.1007/978-3-642-33386-6_23</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4dzubegerbgddnobtxrqoknajq">fatcat:4dzubegerbgddnobtxrqoknajq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170927150056/https://hal.archives-ouvertes.fr/hal-00782354/document" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ae/48/ae48863d4d30c4cb1bc33e01cefdf534e2aff176.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-33386-6_23"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Bounded saturation-based CTL model checking

A Vörös, D Darvas, T Bartha
<span title="">2013</span> <i title="Estonian Academy Publishers"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/mesuscb5nbhe7m5ygzz2nktrwm" style="color: black;">Proceedings of the Estonian Academy of Sciences</a> </i> &nbsp;
Saturation is a symbolic algorithm with a special iteration strategy, which is efficient for asynchronous models.  ...  Recent advances have resulted in many new kinds of saturation-based algorithms for state space generation and bounded state space generation and also for structural model checking.  ...  Gianfranco Ciardo for his valuable advice and suggestions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3176/proc.2013.1.07">doi:10.3176/proc.2013.1.07</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3wagp3wumbhdfed2zpableshye">fatcat:3wagp3wumbhdfed2zpableshye</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170921231000/http://eprints.sztaki.hu/7222/1/PEAS2013_VorosDarvasBartha.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f1/d7/f1d7a4fef9ca02c2571fe541bf332c016b20810b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3176/proc.2013.1.07"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

TEMPORAL LOGICS FOR TRACE SYSTEMS: ON AUTOMATED VERIFICATION

WOJCIECH PENCZEK
<span title="">1993</span> <i title="World Scientific Pub Co Pte Lt"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/yhcgkcmjlvfovferf3in5mkmpq" style="color: black;">International Journal of Foundations of Computer Science</a> </i> &nbsp;
Then, we give a one exponential time model checking algorithm for the logic without nested past modalities.  ...  Next, we show that it is possible to extend the model checking algorithm to cover the whole language and its extension to CTL*P .  ...  The next part of this paper is devoted for de ning a model checking algorithm for CTL P?  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/s0129054193000043">doi:10.1142/s0129054193000043</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rs4bcaph25cinglmhhnmzuljoy">fatcat:rs4bcaph25cinglmhhnmzuljoy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190308143929/http://pdfs.semanticscholar.org/ea06/6bfdab30aec84295b93edeb024b0dae4542f.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ea/06/ea066bfdab30aec84295b93edeb024b0dae4542f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/s0129054193000043"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> worldscientific.com </button> </a>

Towards a Model-Checker for Counter Systems [chapter]

S. Demri, A. Finkel, V. Goranko, G. van Drimmelen
<span title="">2006</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
allowing translation of the whole Presburger-CTL* into Presburger arithmetic, thereby enabling effective model checking.  ...  We have identified a natural class of admissible counter systems (ACS) for which we show that the quantification over paths in CTL* can be simulated by quantification over tuples of natural numbers, eventually  ...  As a corollary, local model-checking problem for EFOCTL (Pr)[n] over ACS is decidable.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11901914_36">doi:10.1007/11901914_36</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/v2iri7t2cfcv3phe6unqer6sxq">fatcat:v2iri7t2cfcv3phe6unqer6sxq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20061129085427/http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DDFG-atva06.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/1a/06/1a060e2e63b351057482151850c37d6bac1fe366.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11901914_36"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Model checking and transitive-closure logic [chapter]

Neil Immerman, Moshe Y. Vardi
<span title="">1997</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Traditionally, CTL and CTL ? have been used to express queries for model checking and then translated into -calculus for symbolic evaluation.  ...  We give a linear-time algorithm to translate any formula from computation tree logic (CTL or CTL*) into an equivalent expression in a variable-con ned fragment of transitive-closure logic FO(TC).  ...  Acknowledgements: Thanks to Kousha Etessami and Thomas Wilke for helpful comments, corrections, and suggestions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-63166-6_29">doi:10.1007/3-540-63166-6_29</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pozwqznvtbc5ff7ozncmctv37i">fatcat:pozwqznvtbc5ff7ozncmctv37i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190226135638/http://pdfs.semanticscholar.org/7f7a/d87fc47bc9ea0b78a2df4fb452429fd01e0b.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7f/7a/7f7ad87fc47bc9ea0b78a2df4fb452429fd01e0b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-63166-6_29"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

On Expressive and Model Checking Power of Propositional Program Logics [chapter]

Nikolai V. Shilov, Kwang Yi
<span title="">2001</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Stirling enjoy the equal model checking power in spite of difference in their expressive powers CTL < µC < 2M: every listed logic has a formula such that every model checker for this particular formula  ...  for models in a class closed w.r.t. finite models, Cartesian products and power-sets can be reused for checking all formulae of these logics in all models in this class.  ...  Paper [23] has exploited model-checking games for practical efficient local model checking.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45575-2_6">doi:10.1007/3-540-45575-2_6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qzfkepswfjgoviq7kb3vgq5s74">fatcat:qzfkepswfjgoviq7kb3vgq5s74</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20120601173255/http://db.iis.nsk.su:80/persons/shilov/psi01.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7d/95/7d95212fd07622ef2b47af4f209c616ec7488213.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45575-2_6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A Survey on Temporal Logics [article]

Savas Konur
<span title="2011-04-25">2011</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This paper surveys main and recent studies on temporal logics in a broad sense by presenting various logic systems, dealing with various time structures, and discussing important features, such as decidability  ...  Although model checking for CTL is linear, CTL* model checking is PSPACEcomplete [38] . Also, solving the satisfiability problem for CTL* is more difficult than solving the CTL satisfiability.  ...  Although model checking is expensive in linear time logics (for example, it is exponential for LTL), model checking complexity of CTL is very efficient, which is linear in the size of model and formula  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1005.3199v3">arXiv:1005.3199v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nogsv2iggvd5likbkrnmnzpsdu">fatcat:nogsv2iggvd5likbkrnmnzpsdu</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1005.3199/1005.3199.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/86/cc/86cc348b7c2f895029812f17718754f0814e46ef.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1005.3199v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Industrial applications of the PetriDotNet modelling and analysis tool

András Vörös, Dániel Darvas, Ákos Hajdu, Attila Klenik, Kristóf Marussy, Vince Molnár, Tamás Bartha, István Majzik
<span title="">2018</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hq6x4whtd5hhlhsxzculyeamey" style="color: black;">Science of Computer Programming</a> </i> &nbsp;
This motivated our work to develop PetriDotNet, a Petri net editor and analysis tool. In this paper we overview the supported modelling formalisms and the analysis methods included in PetriDotNet.  ...  Since their invention, Petri nets have provided modelling and analysis methods to support the design of correct, reliable and robust systems.  ...  Szilvási, A. Jámbor, Z. Mártonka, D. Segesdi, and T. Szabó. We thank M. Telek for the assistance in the design of stochastic analysis algorithms.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.scico.2017.09.003">doi:10.1016/j.scico.2017.09.003</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3ceytamrxjatbdkdqv4ea5niea">fatcat:3ceytamrxjatbdkdqv4ea5niea</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180719043519/http://real.mtak.hu/73987/1/SCP2017_VorosEtAl.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/12/e0/12e0cc87f45b87263fdfc19b8913722f42ae96ee.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.scico.2017.09.003"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 3,758 results