Filters








90,090 Hits in 6.9 sec

Extending nuXmv with Timed Transition Systems and Timed Temporal Properties [chapter]

Alessandro Cimatti, Alberto Griggio, Enrico Magnago, Marco Roveri, Stefano Tonetta
<span title="">2019</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
NUXMV is a well-known symbolic model checker, which implements various state-of-the-art algorithms for the analysis of finite-and infinite-state transition systems and temporal logics.  ...  The analysis is performed via a reduction to verification problems in the discrete-time case.  ...  CTAV [24] reduces the model checking problem for an MTL 0,∞ property ϕ to a symbolic language emptiness check of a timed Büchi automata for ϕ.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-030-25540-4_21">doi:10.1007/978-3-030-25540-4_21</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gfinmd2psnb5jf4v2lzhsddefm">fatcat:gfinmd2psnb5jf4v2lzhsddefm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200307064635/https://link.springer.com/content/pdf/10.1007%2F978-3-030-25540-4_21.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/da/83/da83fa77819fcb494a8048688ff904ecbadd3d41.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-030-25540-4_21"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Making the Right Cut in Model Checking Data-Intensive Timed Systems [chapter]

Rüdiger Ehlers, Michael Gerke, Hans-Jörg Peter
<span title="">2010</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;
In this paper, we introduce a simple general framework for combining both data structures, enabling a joint symbolic representation of the timed state sets in the reachability fixed point construction.  ...  Especially in the analysis of models with only few clocks, large constants, and a huge discrete state space (such as, e.g., data-intensive communication protocols), our technique turns out to be highly  ...  State-of-the-art model checking approaches for timed systems can broadly be classified into two categories: semi-symbolic approaches and fully symbolic approaches [19] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-16901-4_37">doi:10.1007/978-3-642-16901-4_37</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/m64gkdflrfbetjjbi4ifdzfr4u">fatcat:m64gkdflrfbetjjbi4ifdzfr4u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200321040404/https://www.react.uni-saarland.de/publications/icfem2010.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/59/81/59816cc23e4fac2727776bacc710b6380c6ae4a6.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-16901-4_37"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Fully Symbolic TCTL Model Checking for Incomplete Timed Systems

Georges Morbé, Christoph Scholl
<span title="2014-01-23">2014</span> <i title="European Association of Software Science and Technology"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ds6dyxrqzrddpmxtwf2p5ljfn4" style="color: black;">Electronic Communications of the EASST</a> </i> &nbsp;
In this paper we present a fully symbolic TCTL model checking algorithm for incomplete timed systems.  ...  The algorithm works on a symbolic model for timed systems, called a finite state machine with time (FSMT), and makes use of fully symbolic state set representations containing both the clock values and  ...  Conclusion We presented a fully symbolic TCTL model checking algorithm for FSMTs able to handle incomplete timed systems.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14279/tuj.eceasst.66.897">doi:10.14279/tuj.eceasst.66.897</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/journals/eceasst/MorbeS13.html">dblp:journals/eceasst/MorbeS13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qr2yj52pabgvrnivmf32pbh2aa">fatcat:qr2yj52pabgvrnivmf32pbh2aa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706091908/https://journal.ub.tu-berlin.de/eceasst/article/download/897/881/" 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/f4/b8/f4b8c87e5d367a8267ee551c804b6374561bbbed.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14279/tuj.eceasst.66.897"> <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>

Fully Symbolic Model Checking for Timed Automata [chapter]

Georges Morbé, Florian Pigorsch, Christoph Scholl
<span title="">2011</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 present a model checking algorithm for FSMTs, which works on fully symbolic state sets containing both the clock values and the state variables.  ...  In this paper we introduce a new formal model, called finite state machines with time (FSMT), to represent real-time systems.  ...  Conclusions We presented a new formal model to represent real-time systems, the finite state machine with time, which is well-suited for fully symbolic verification algorithms.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-22110-1_50">doi:10.1007/978-3-642-22110-1_50</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jx4ulqsk2ffs5jafnichbvr2ey">fatcat:jx4ulqsk2ffs5jafnichbvr2ey</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810201606/http://www.avacs.org/fileadmin/Publikationen/Open/morbe.cav2011.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/e2/7f/e27fd39d5e358f15d4e548e57a54ac52330d0af1.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-22110-1_50"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A novel procedure for statistical inference and verification of gene regulatory subnetwork

Haijun Gong, Jakob Klinger, Kevin Damazyn, Xiangrui Li, Shiyang Huang
<span title="">2015</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/n5zrklrhlzhtdorf4rk4rmeo3i" style="color: black;">BMC Bioinformatics</a> </i> &nbsp;
The dynamic Bayesian network, a statistical inference algorithm, is at first implemented to infer an optimal network from time series microarray data of S. cerevisiae, then, a weighted symbolic model checker  ...  Conclusions: Our studies show that the marriage of statistical inference algorithm with model checking technique provides a more efficient way to automatically infer and verify the gene regulatory network  ...  Hartemink for answering some questions related to Banjo.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1186/1471-2105-16-s7-s7">doi:10.1186/1471-2105-16-s7-s7</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/25952938">pmid:25952938</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC4423581/">pmcid:PMC4423581</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bnigq6zcsbgnnixoqjb3qk7bpy">fatcat:bnigq6zcsbgnnixoqjb3qk7bpy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170819061622/https://bmcbioinformatics.biomedcentral.com/track/pdf/10.1186/1471-2105-16-S7-S7?site=bmcbioinformatics.biomedcentral.com" 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/42/fb42b3d0e4179056814051880eea4beb61fe24b6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1186/1471-2105-16-s7-s7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> springer.com </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4423581" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

Symbolic Model Checking for Rectangular Hybrid Systems [chapter]

Thomas A. Henzinger, Rupak Majumdar
<span title="">2000</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 remedy this unsatisfactory situation: we present a symbolic method for Ltl model checking which can be performed by HyTech and is guaranteed to terminate on all rectangular automata.  ...  However, on one hand, the original proofs of decidability did not suggest practical algorithms and, on the other hand, practical symbolic model-checking procedures -such as those implemented in HyTech-were  ...  Acknowledgments We thank Luca de Alfaro for several useful discussions. Symbolic Model Checking for Rectangular Hybrid Systems  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-46419-0_11">doi:10.1007/3-540-46419-0_11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ltrqlnogh5gs7h6tqzgkiggfxe">fatcat:ltrqlnogh5gs7h6tqzgkiggfxe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170916191153/https://link.springer.com/content/pdf/10.1007%2F3-540-46419-0_11.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/b3/bf/b3bfe2e48a2ab162091465b94e9dbf8e657f8aa7.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-46419-0_11"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Symbolic and Parametric Model Checking of Discrete-Time Markov Chains [chapter]

Conrado Daws
<span title="">2005</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 present a language-theoretic approach to symbolic model checking of PCTL over discrete-time Markov chains.  ...  This allows for parametric model checking by evaluating the regular expression for different parameter values, for instance, to study the influence of a lossy channel in the overall reliability of a randomized  ...  We are grateful to Joost-Pieter Katoen for his comments on an early version of this paper, Wan Fokkink for his encouragement, and Ryszard Janicki for helping clarify our results.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-31862-0_21">doi:10.1007/978-3-540-31862-0_21</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ppq4b2y4jzdsff7drnv2yjrkji">fatcat:ppq4b2y4jzdsff7drnv2yjrkji</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190216193601/http://pdfs.semanticscholar.org/02d2/ba3cdd5ea699bfe65cb5d7d75f1537aacb77.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/02/d2/02d2ba3cdd5ea699bfe65cb5d7d75f1537aacb77.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-540-31862-0_21"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Lazy Reachability Checking for Timed Automata with Discrete Variables [chapter]

Tamás Tóth, István Majzik
<span title="">2018</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We combine in a single algorithm our abstraction method with known efficient lazy abstraction algorithms for the handling of clock variables.  ...  In this paper, we propose a lazy abstraction method for the location reachability problem of timed automata that can be used to efficiently control the visibility of discrete variables occurring in such  ...  Algorithm for Lazy Reachability Checking In this section, we present our algorithm for lazy reachability checking of timed automata with discrete variables.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-94111-0_14">doi:10.1007/978-3-319-94111-0_14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lkb3gkjv6rfttb3kkqjepdubb4">fatcat:lkb3gkjv6rfttb3kkqjepdubb4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190219224535/http://pdfs.semanticscholar.org/1c0f/4acc85e07eba5eb3722822f3b1aace02a417.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/1c/0f/1c0f4acc85e07eba5eb3722822f3b1aace02a417.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-319-94111-0_14"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A symbolic approach for mixed-signal model checking

Alexander Jesser, Lars Hedrich
<span title="">2008</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fkjmyf3l45eo5ovjdnpeqpdjd4" style="color: black;">2008 Asia and South Pacific Design Automation Conference</a> </i> &nbsp;
In this paper we firstly introduce a novel symbolic model checker (MScheck) for mixed-signal circuits.  ...  Timing information of both systems will be symbolically stored within multi terminal binary decision diagrams (MTBDDs) for the entire verification procedure.  ...  CONCLUSION This paper introduces a novel approach for symbolic mixedsignal circuit model checking.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/aspdac.2008.4483984">doi:10.1109/aspdac.2008.4483984</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/aspdac/JesserH08.html">dblp:conf/aspdac/JesserH08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hwleu2xrtzalxaytdxvhxhjwdi">fatcat:hwleu2xrtzalxaytdxvhxhjwdi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170815094323/http://www.cecs.uci.edu/~papers/aspdac08/pdf/p404_5A-2.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/af/d3/afd3ac9fff9983d83ea9cfeda3e39920caaf9c0c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/aspdac.2008.4483984"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

A New Minimum Trees-Based Approach for Shape Matching with Improved Time Computing: Application to Graphical Symbols Recognition [chapter]

Patrick Franco, Jean-Marc Ogier, Pierre Loonis, Rémy Mullot
<span title="">2010</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 model no longer operates in the image space but in a compact space, namely the Discrete Cosine space. The use of block discrete cosine transform is discussed and justified.  ...  Recently we have developed a model for shape description and matching. Based on minimum spanning trees construction and specifics stages like the mixture, it seems to have many desirable properties.  ...  The impact of time learning models especially for future web applications -such as "an on line user select on the fly an arbitrary symbol in a technical document and queries for similar symbols" -could  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-13728-0_14">doi:10.1007/978-3-642-13728-0_14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/oclq4qm3cvdifd76lkthemf4ku">fatcat:oclq4qm3cvdifd76lkthemf4ku</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190216220607/http://pdfs.semanticscholar.org/0371/e1b9b510349d050cdaa1531959f475ce601d.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/03/71/0371e1b9b510349d050cdaa1531959f475ce601d.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-13728-0_14"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Bounded Model Checking for Region Automata [chapter]

Fang Yu, Bow-Yaw Wang, Yao-Wen Huang
<span title="">2004</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;
· xBMC v2.1: an unbounded model checker for real-time systems based on incorporating induction proofs (proposed in ATVA 2004) · xBMC v2.0: a bounded model checker for real time systems based on discretization  ...  of region automata (proposed in FORMATS-FTRTFT 2004) · xBMC v1.1: a discrete bounded model chekcer for software verification based on static single assignment enviroment · xBMC v1.0: a discrete  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-30206-3_18">doi:10.1007/978-3-540-30206-3_18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/g5sawav6rvbtfntyihfbjtp3re">fatcat:g5sawav6rvbtfntyihfbjtp3re</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20050205144044/http://www.iis.sinica.edu.tw:80/~yuf/cv.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/79/69/79698ae6633a87c9aafba2184c93df041521051f.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-540-30206-3_18"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Modeling time series of climatic parameters with probabilistic finite automata

L. Mora-López, J. Mora, R. Morales-Bueno, M. Sidrach-de-Cardona
<span title="">2005</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/irxlz6wefjcmnddydjot2v3uii" style="color: black;">Environmental Modelling &amp; Software</a> </i> &nbsp;
For this, a new adaptable test based on the classical KolmogoroveSmirnov two-sample test has been done.  ...  A model to characterize and predict continuous time series from machine-learning techniques is proposed.  ...  Using these PFA, a method to predict new values of the parameter has been proposed. Finally, the model has been checked using several tests.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.envsoft.2004.04.007">doi:10.1016/j.envsoft.2004.04.007</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/iqlr4vhc5falnnhxnpgk5vqmke">fatcat:iqlr4vhc5falnnhxnpgk5vqmke</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810132602/http://atarazanas.sci.uma.es/docs/articulos/16615244.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/78/6f/786f5c15b36c9e5dfa2bf3975ca5426db736d199.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.envsoft.2004.04.007"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Implicit Representations and Algorithms for the Logic and Stochastic Analysis of Discrete–State Systems [chapter]

Gianfranco Ciardo
<span title="">2005</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;
Indeed, the fraction of the states that can actually be explored in a reasonable amount of time becomes exponentially smaller as the complexity of the system being modeled (measured in number of components  ...  As discrete-state systems are pervasive in our society, it is essential that we model and analyze them effectively, both prior to putting them in operation and during their useful life.  ...  fixed-point algorithms used in state-space generation [3, 7] and CTL model checking [6] to vector-matrix multiplications [2] needed for the numerical solution of a Markov model: multiway decision  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11549970_2">doi:10.1007/11549970_2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7jeul2sc3vfk5l3qqz52ys6pum">fatcat:7jeul2sc3vfk5l3qqz52ys6pum</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200321010628/http://web.cs.iastate.edu/~ciardo/pubs/2005EPEW-key-WSFM.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/b5/a5/b5a5e09419ce619615a2c588539e3f793f01149b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11549970_2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Fully symbolic TCTL model checking for complete and incomplete real-time systems

Georges Morbé, Christoph Scholl
<span title="">2015</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;
We present a model checking algorithm for FSMTs, which works on fully symbolic state sets containing both the clock values and the state variables.  ...  In this paper we introduce a new formal model, called finite state machines with time (FSMT), to represent real-time systems.  ...  We present a fully symbolic model checking algorithm for FSMTs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.scico.2015.08.002">doi:10.1016/j.scico.2015.08.002</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/67wt42hdv5ef3hqntyjlrejmzi">fatcat:67wt42hdv5ef3hqntyjlrejmzi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829171725/http://abs.informatik.uni-freiburg.de/papers/2014/MS_2014.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/e9/80/e9805b1cfcb918ec9d28eabf09afc0b7a797125c.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.2015.08.002"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Model Checking Semi-Continuous Time Models Using BDDs

Sérgio Campos, Márcio Teixeira, Marius Minea, Andreas Kuehlmann, Edmund Clarke
<span title="">2001</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/uy5mv2ncw5eahkdx47hkrglxmm" style="color: black;">Electronical Notes in Theoretical Computer Science</a> </i> &nbsp;
We then use these algorithms to introduce a new model of time, in which the passage of time is dissociated from the occurrence of events.  ...  One possible use of model checking to analyze timed systems is by modeling passage of time as the number of taken transitions and applying quantitative algorithms to determine the timing parameters of  ...  Acknowledgments We would like to thank Howard Wong-Toi for the many useful discussions about the examples that have been veri ed in HyTech.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s1571-0661(04)80670-4">doi:10.1016/s1571-0661(04)80670-4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/okqsrqgvsnfjro55oktktsjcvq">fatcat:okqsrqgvsnfjro55oktktsjcvq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171202231028/http://staff.cs.upt.ro/~marius/papers/smc99.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/de/7dde79fca394399b5dc11f5c2c3ceeeedb92cb1f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s1571-0661(04)80670-4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> elsevier.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 90,090 results