Filters








85 Hits in 1.8 sec

An improvement of McMillan's unfolding algorithm [chapter]

Javier Esparza, Stefan Römer, Walter Vogler
<span title="">1996</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 technique requires to construct a finite initial part of the unfolding of the net.  ...  McMillan's algorithm for this task may yield initial parts that are larger than necessary (exponentially larger in the worst case).  ...  Acknowledgements We thank Michael Kishinevsky, Alexander Taubin and Alex Yakovlev for drawing our attention to this problem, Burkhard Graves for detecting some mistakes, and an anonymous referee for helpful  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-61042-1_40">doi:10.1007/3-540-61042-1_40</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/aw76b2lm75ctvflbjry2qxewdm">fatcat:aw76b2lm75ctvflbjry2qxewdm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190501012637/https://link.springer.com/content/pdf/10.1007%2F3-540-61042-1_40.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/15/a7/15a77f30bd32f78f3a8cab299ff9331a91db6f03.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-61042-1_40"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Improvements to the Implementation of Interpolant-Based Model Checking [chapter]

João Marques-Silva
<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;
This paper addresses the utilization of interpolants in UMC and proposes two techniques for improving the original interpolant-based UMC algorithm.  ...  These techniques include improvements to the computation of interpolants, and redefining the organization of the unbounded model checking algorithm given the information extracted from interpolant computation  ...  See [3] for a detailed description of McMillan's UMC algorithm.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11560548_33">doi:10.1007/11560548_33</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dfsh2byc6rfnhbtk7s7wnse4by">fatcat:dfsh2byc6rfnhbtk7s7wnse4by</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922061921/https://eprints.soton.ac.uk/261691/1/jpms-charme05.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/e1/ff/e1ff64f1c6a8852b594f770029dbbab03aec505a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11560548_33"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A False History of True Concurrency: From Petri to Tools [chapter]

Javier Esparza
<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;
I briefly review the history of the unfolding approach to model checking. Carl Adam Petri passed away on July 2, 2010.  ...  However, here I only touch upon those aspects of the theory that directly inspired the unfolding approach.  ...  Second, McMillan's algorithms could only check specific problems, like deadlock freedom or conformance. Both problems were overcome in the next years.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-16164-3_13">doi:10.1007/978-3-642-16164-3_13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rutvfbv5kzen5kk2rfsnhyw7im">fatcat:rutvfbv5kzen5kk2rfsnhyw7im</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811201451/https://www7.in.tum.de/um/bibdb/esparza/spin10.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/31/22/3122eae458e4556c986591f80da0866ef55eb14e.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-16164-3_13"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

McMillan's Complete Prefix for Contextual Nets [chapter]

Paolo Baldan, Andrea Corradini, Barbara König, Stefan Schwoon
<span title="">2008</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;
When working with contextual nets, a finite complete prefix can be obtained by applying McMillan's construction to a suitable encoding of the contextual net into an ordinary net.  ...  In a seminal paper, McMillan proposed a technique for constructing a finite complete prefix of the unfolding of bounded (i.e., finitestate) Petri nets, which can be used for verification purposes.  ...  McMillan's algorithm constructs a finite complete prefix, i.e., a subnet of the unfolding such that each marking reachable in the original net corresponds to some concurrent set of places in such a prefix  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-89287-8_12">doi:10.1007/978-3-540-89287-8_12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zg2ixboyrnet5clzpdn5x4ax4a">fatcat:zg2ixboyrnet5clzpdn5x4ax4a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705131245/http://www.ti.inf.uni-due.de/publications/koenig/ufo07.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/f0/bc/f0bcf29fd6a3f61048c8b1d47bd23e3b774646c1.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-89287-8_12"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A Complete Finite Prefix for Process Algebra [chapter]

Rom Langerak, Ed Brinksma
<span title="">1999</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 simple adequate order (using an order on process algebra expressions) as an optimization to McMillan's original algorithm.  ...  We present the model of component event structures as a semantics for process algebra, and show how to construct a complete finite prefix for this model.  ...  Acknowledgements Many thanks to Joost-Pieter Katoen, Diego Latella and Mieke Massink for extensive discussions and many suggestions for improvement.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-48683-6_18">doi:10.1007/3-540-48683-6_18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/okgl23cfrjemxeregzsj7yqj2e">fatcat:okgl23cfrjemxeregzsj7yqj2e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190306203805/http://pdfs.semanticscholar.org/ec94/61e3ee609e135560c641d7a5416dbe0b4745.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/ec/94/ec9461e3ee609e135560c641d7a5416dbe0b4745.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-48683-6_18"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Unfolding and finite prefix for nets with read arcs [chapter]

Walter Vogler, Alex Semenov, Alex Yakovlev
<span title="">1998</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;
It is shown that the existing conditions for nite pre x construction (McMillan's one and its improvement b y Esparza et al.) can only be applied for a subclass of nets with read arcs, the so-called read-persistent  ...  The paper rede nes the concepts of a branching process and unfolding for nets with read arcs and proves that the set of reachable markings of a net is completely represented by its unfolding.  ...  In this section we apply the (improved) McMillan's algorithm ERV96] for constructing a nite pre x of the unfolding.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bfb0055644">doi:10.1007/bfb0055644</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/74cby6izgbhnho2zw2wqfrxfoy">fatcat:74cby6izgbhnho2zw2wqfrxfoy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170921231016/http://www.cs.ncl.ac.uk/research/pubs/trs/papers/634.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/4b/a9/4ba9f5c1191604dae9a3e3ba21d283c56b885256.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bfb0055644"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Verification based on local states [chapter]

Michaela Huhn, Peter Niebert, Frank Wallner
<span title="">1998</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 reduce veri cation of local properties to standard model checking algorithms known for interleaving branchingtime logics.  ...  The key is to extract a nite (usually small), local transition system bisimilar to the complete unfolding. The construction is based on the nite pre x of a net unfolding de ned by McMillan.  ...  Burkhard Graves has helped our understanding of the subtleties of Fin. Special thanks to Javier Esparza, whose contribution to this work in its initial phase was very important.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bfb0054163">doi:10.1007/bfb0054163</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tbptns2abbbenaah75wxnzw7re">fatcat:tbptns2abbbenaah75wxnzw7re</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190304170409/http://pdfs.semanticscholar.org/c985/e3f005e279e20d1f9e7248c4c5aacb4430fb.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/c9/85/c985e3f005e279e20d1f9e7248c4c5aacb4430fb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bfb0054163"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

An Incremental and Backward-Conflict Guided Method for Unfolding Petri Nets

Dongming Xiang, Xiaoyan Tao, Yaping Liu
<span title="2021-02-28">2021</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/nzoj5rayr5hutlurimhzyjlory" style="color: black;">Symmetry</a> </i> &nbsp;
Subsequently, we propose an improved method for computing configurations and cuts. Meanwhile, backward conflicts are used to guide the calculations of cut-off events.  ...  During the unfolding process of a Petri net, the calculations of configurations, cuts, and cut-off events are the key factors for the unfolding efficiency.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/sym13030392">doi:10.3390/sym13030392</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zx755qcq4nechphomg6ygf5ftq">fatcat:zx755qcq4nechphomg6ygf5ftq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210428123340/https://res.mdpi.com/d_attachment/symmetry/symmetry-13-00392/article_deploy/symmetry-13-00392-v2.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/1b/30/1b30941494bb9598834a25f395e8c806500fc8e3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/sym13030392"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a>

Parallelisation of the Petri Net Unfolding Algorithm [chapter]

Keijo Heljanko, Victor Khomenko, Maciej Koutny
<span title="">2002</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 first present theoretical results, helping to understand the unfolding algorithm presented in [5, 6] .  ...  F ) and an initial marking M 0 .  ...  Acknowledgements This research was supported by an ORS Awards Scheme grant ORS/C20/4 and by an EPSRC grant GR/M99293.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-46002-0_26">doi:10.1007/3-540-46002-0_26</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wbxf5txmerdy3fj7e4rooxo6da">fatcat:wbxf5txmerdy3fj7e4rooxo6da</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20040728015430/http://www.tcs.hut.fi:80/~kepa/publications/CS-TR-733.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/05/ef/05ef3534bbaca9c3b64227d567aa6386858adf8e.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-46002-0_26"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Minimally perturbing a gene regulatory network to avoid a disease phenotype: the glioma network as a test case

Guy Karlebach, Ron Shamir
<span title="">2010</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xua5vbjwszdirewaoqnikiu5zm" style="color: black;">BMC Systems Biology</a> </i> &nbsp;
By modifying McMillan's unfolding algorithm, we handle partial knowledge and reduce computation cost. The methodology is demonstrated on a glioma network.  ...  Results: We present an algorithm that determines the smallest perturbations required for manipulating the dynamics of a network formulated as a Petri net, in order to cause or avoid a specified phenotype  ...  McMillan's unfolding algorithm [46] is a method for dealing with the state explosion problem for Petri nets. A full description of the unfolding algorithm can be found in ref. [47] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1186/1752-0509-4-15">doi:10.1186/1752-0509-4-15</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/20184733">pmid:20184733</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC2851584/">pmcid:PMC2851584</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mfpakf2wr5cw5cbsb646oihfpm">fatcat:mfpakf2wr5cw5cbsb646oihfpm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170819015511/https://bmcsystbiol.biomedcentral.com/track/pdf/10.1186/1752-0509-4-15?site=bmcsystbiol.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/8f/f3/8ff300b7d574675b0c83080d28887e6655b97657.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1186/1752-0509-4-15"> <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/PMC2851584" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

Towards an Efficient Algorithm for Unfolding Petri Nets [chapter]

Victor Khomenko, Maciej Koutny
<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;
In this paper, we propose several improvements to the existing algorithms for generating finite complete prefixes of net unfoldings.  ...  Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem.  ...  The first author was supported by an ORS Awards Scheme grant ORS/C20/4 and by an EPSRC grant GR/M99293.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-44685-0_25">doi:10.1007/3-540-44685-0_25</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uwvsa6qwnzdqzahrj533mwzhhq">fatcat:uwvsa6qwnzdqzahrj533mwzhhq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705071725/http://homepages.cs.ncl.ac.uk/victor.khomenko/papers/CONCUR-2001.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/8b/df/8bdf8e2c2fb24074db365f0819c7f40ead89061a.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-44685-0_25"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Black Box Unfolding with Local First Search [chapter]

Sebastien Bornot, Remi Morin, Peter Niebert, Sarah Zennou
<span title="">2002</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;
McMillan's unfolding approach to the reachability problem in 1-safe Petri nets and its later improvements by Esparza-Römer-Vogler have proven in practice as a very effective method to avoid stateexplosion  ...  Since it works for any transition system with an independence relation, this black box partial unfolding remains more general than the unfolding of Petri nets.  ...  We thank Denis Lugiez for discussions, valuable comments, and human support during the preparation of this work.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-46002-0_27">doi:10.1007/3-540-46002-0_27</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tcd34hdutvdetoenkej22gjzmm">fatcat:tcd34hdutvdetoenkej22gjzmm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190504155542/https://link.springer.com/content/pdf/10.1007%2F3-540-46002-0_27.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/6e/2b/6e2b87bb553046c2efcd7173fa302b3ed3505127.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-46002-0_27"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

First Passage Time Analysis of Stochastic Process Algebra Using Partial Orders [chapter]

Theo C. Ruys, Rom Langerak, Joost-Pieter Katoen, Diego Latella, Mieke Massink
<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;
time of an event.  ...  Based on an adaptation of McMillan's complete finite prefix approach tailored to event structures and process algebra, finite representations are obtained for recursive processes.  ...  Acknowledgements We want to thank Markus Siegle from the University of Erlangen for kindly giving us permission to use the Pepp tool.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45319-9_16">doi:10.1007/3-540-45319-9_16</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nxfnhfru4jbe5lilehqbyjxtba">fatcat:nxfnhfru4jbe5lilehqbyjxtba</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180726201045/https://link.springer.com/content/pdf/10.1007%2F3-540-45319-9_16.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/4b/d1/4bd13c32b610897c01465361e9f60319b4254ca2.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-45319-9_16"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Interpolant Learning and Reuse in SAT-Based Model Checking

Joao Marques-Silva
<span title="">2007</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;
Bounded Model Checking (BMC) is one of the most paradigmatic practical applications of Boolean Satisfiability (SAT).  ...  Despite their success, interpolants have only been used for identifying a fixed point of the set of reachable states. This paper extends the utilization of interpolants in SAT-based model checking.  ...  This section reviews McMillan's interpolant-based UMC algorithm [21] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.entcs.2006.12.021">doi:10.1016/j.entcs.2006.12.021</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/f5lz3fkpxvbnljt5z23fbzpcsu">fatcat:f5lz3fkpxvbnljt5z23fbzpcsu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20080424152108/http://eprints.ecs.soton.ac.uk/13663/1/jpms-entcs07.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/68/85/6885209a3548b1f7a6b43dca4cd453b113d2822f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.entcs.2006.12.021"> <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>

Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets [chapter]

Keijo Heljanko
<span title="">1999</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;
Experimental results are given from an implementation combining the pre x generator of the PEP-tool, the translation, and an implementation of a constraint-based logic programming framework, the smodels  ...  McMillan suggested a branch-and-bound algorithm for deadlock detection in pre xes.  ...  McMillan's algorithm is most competitive when the number of cut-o events is relatively small.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-49059-0_17">doi:10.1007/3-540-49059-0_17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wyc6hye7vbfe7lidhztctycfc4">fatcat:wyc6hye7vbfe7lidhztctycfc4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190227092847/http://pdfs.semanticscholar.org/78e5/f0c8c55e83c32020caa85ce54a6105fff6ef.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/e5/78e5f0c8c55e83c32020caa85ce54a6105fff6ef.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-49059-0_17"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 85 results