Filters








21 Hits in 2.3 sec

PLTL-partitioned model checking for reactive systems under fairness assumptions

S. Chouali, J. Julliand, P.-A. Masson, F. Bellegarde
<span title="2005-05-01">2005</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3yu4mbaainhw5gol4yayc35pfe" style="color: black;">ACM Transactions on Embedded Computing Systems</a> </i> &nbsp;
We are interested in verifying dynamic properties of finite state reactive systems under fairness assumptions by model checking.  ...  We then show that with such a partition, if a property P is verifiable by parts and if f is the expression of the fairness assumptions on a system, then the property f => P is still verifiable by parts  ...  of the Partitioned Model Checking under Fairness Assumptions In this section, we show that model checking by parts under fairness assumptions is sound.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1067915.1067918">doi:10.1145/1067915.1067918</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ffmrqagzn5f23opzh55ukma32q">fatcat:ffmrqagzn5f23opzh55ukma32q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190323175308/https://core.ac.uk/download/pdf/54050283.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/6f/d8/6fd8a6fb4b56daf9d79165e6ee68def254813924.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1067915.1067918"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Partitioned PLTL model-checking for refined transition systems

J. Julliand, P.-A. Masson, E. Oudot
<span title="">2009</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/joe2ngto45hbnl3pncnesnq344" style="color: black;">Information and Computation</a> </i> &nbsp;
This paper is about the verification of dynamic properties by model-checking for finite state reactive systems. Properties are expressed as PLTL formulae.  ...  In particular, the new class includes liveness properties under fairness assumptions. This class is defined from Büchi automata that accept the language of the negations of the properties.  ...  This automaton accepts the negation of the PLTL property ( ♦p ⇒ ♦q) ⇒ (r ⇒ ♦s), which is a liveness property under a fairness assumption.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ic.2009.02.001">doi:10.1016/j.ic.2009.02.001</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jpobqpacdrfuhhtlx25jcwr464">fatcat:jpobqpacdrfuhhtlx25jcwr464</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190312090143/https://core.ac.uk/download/pdf/82199242.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/3f/01/3f01143bc27d73c78716e1a6e1ff7f678eb80e2c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ic.2009.02.001"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Refining Real-Time System Specifications through Bounded Model- and Satisfiability-Checking

Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro
<span title="">2008</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hj24pr6lvba3dfi5muhp4mz5tm" style="color: black;">2008 23rd IEEE/ACM International Conference on Automated Software Engineering</a> </i> &nbsp;
In Bounded Model Checking (BMC) a system is modeled with a finite automaton and various desired properties with temporal logic formulae.  ...  Bounded Satisfiability Checking (BSC) adopts a similar approach, but both the system and the properties are modeled with temporal logic formulae, without an underlying operational model.  ...  ACKNOWLEDGEMENTS We thank Paolo Lischetti for developing the operational version of the Real-time Allocator. Work partially supported by FME Small Project.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ase.2008.22">doi:10.1109/ase.2008.22</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/kbse/PradellaMP08.html">dblp:conf/kbse/PradellaMP08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/f6vc7rcikvbb3p3r23nk4tn4u4">fatcat:f6vc7rcikvbb3p3r23nk4tn4u4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20090709194600/http://home.dei.polimi.it/pradella/papers/pms-ase08.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/49/66/496654409a262fd71fdeccc5486874958c9fbb42.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ase.2008.22"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Formally Reasoning About Quality

Shaull Almagor, Udi Boker, Orna Kupferman
<span title="2016-06-17">2016</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/r72grtxx6jad5hjzl7fxcunwhi" style="color: black;">Journal of the ACM</a> </i> &nbsp;
We demonstrate the usefulness of both extensions and study the decidability and complexity of the decision and search problems for them as well as for extensions of LTL that combine both types of operators  ...  As opposed to traditional verification, in which one considers the question of whether a system satisfies a given specification or not, reasoning about quality addresses the question of how well the system  ...  As in LTL disc [D] , our solution for the PLTL disc [D] model-checking problem is by translating PLTL disc [D] formulas to automata.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2875421">doi:10.1145/2875421</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ni3xosyq2vc6vgupdaijcghzmi">fatcat:ni3xosyq2vc6vgupdaijcghzmi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190204080733/http://www.faculty.idc.ac.il:80/udiboker/files/FormallyReasoningAboutQuality.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/63/41/6341f16d545f1009da93b9ad114c745d885741dc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2875421"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Unifying Hyper and Epistemic Temporal Logic [article]

Laura Bozzelli, Bastien Maubert, Sophie Pinchinat
<span title="2014-09-09">2014</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Moreover, we show that the model-checking problem for this novel logic is decidable, and we provide its exact computational complexity in terms of a new measure of path quantifiers' alternation.  ...  For this, we settle open complexity issues for unrestricted quantified propositional temporal logic.  ...  Introduction Temporal logics provide a fundamental framework for the description of the dynamic behavior of reactive systems.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1409.2711v1">arXiv:1409.2711v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lju7xta4vrdfddhtzariyl47te">fatcat:lju7xta4vrdfddhtzariyl47te</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191021072244/https://arxiv.org/pdf/1409.2711v1.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/08/17/0817ce584c0c7a4a360ee737b443cd74fd495f58.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1409.2711v1" 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>

Extracting unsatisfiable cores for LTL via temporal resolution

Viktor Schuppan
<span title="2015-05-31">2015</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cnqseeosvrf6tnj6sc3lbn2y4e" style="color: black;">Acta Informatica</a> </i> &nbsp;
Unsatisfiable cores (UCs) are a well established means for debugging in a declarative setting. Still, there are few tools that perform automated extraction of UCs for LTL.  ...  to remove parts not required for unsatisfiability inside ψ and ψ'.  ...  Ludwig for making TRP++ and TSPASS available. I also thank A. Cimatti for bringing up the subject of temporal resolution.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00236-015-0242-1">doi:10.1007/s00236-015-0242-1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bckmqk6qljh3nex3hoyvpdtidu">fatcat:bckmqk6qljh3nex3hoyvpdtidu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170921225355/http://www.schuppan.de/viktor/VSchuppan-TIME-2013-preprint.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/d1/46/d146b456b0091e62f3c79a079be0482940cace7d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00236-015-0242-1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Extracting Unsatisfiable Cores for LTL via Temporal Resolution

Viktor Schuppan
<span title="">2013</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5notxo7dsndjfej4w6752adxc4" style="color: black;">2013 20th International Symposium on Temporal Representation and Reasoning</a> </i> &nbsp;
Unsatisfiable cores (UCs) are a well established means for debugging in a declarative setting. Still, tools that perform automated extraction of UCs for LTL are scarce.  ...  In this paper we construct and optimize resolution graphs for temporal resolution as implemented in the temporal resolutionbased solver TRP++ and we use them to extract UCs for propositional LTL.  ...  Ludwig for making TRP++ and TSPASS available. I also thank A. Cimatti for bringing up the subject of temporal resolution.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/time.2013.15">doi:10.1109/time.2013.15</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/time/Schuppan13.html">dblp:conf/time/Schuppan13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tr7hyzxolzdsxnrsp4eqixgxki">fatcat:tr7hyzxolzdsxnrsp4eqixgxki</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170921225355/http://www.schuppan.de/viktor/VSchuppan-TIME-2013-preprint.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/d1/46/d146b456b0091e62f3c79a079be0482940cace7d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/time.2013.15"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Unifying Hyper and Epistemic Temporal Logics [chapter]

Laura Bozzelli, Bastien Maubert, Sophie Pinchinat
<span title="">2015</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;
Moreover, we show that the model-checking problem for this novel logic is decidable, and we provide its exact computational complexity in terms of a new measure of path quantifiers' alternation.  ...  Like HyperCTL * and KCTL * , the finite-state model-checking problem for the novel logic is non-elementarily decidable, and we provide the exact complexity of this problem in terms of a variant of the  ...  Introduction Temporal logics provide a fundamental framework for the description of the dynamic behavior of reactive systems.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-46678-0_11">doi:10.1007/978-3-662-46678-0_11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6ajv7nzfkfbufhvryahfszhqcq">fatcat:6ajv7nzfkfbufhvryahfszhqcq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190225222414/http://pdfs.semanticscholar.org/68f6/9ea29e237e5693b6f3b85f363c8c6a5637bb.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/f6/68f69ea29e237e5693b6f3b85f363c8c6a5637bb.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-662-46678-0_11"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Learning deterministic probabilistic automata from a model checking perspective

Hua Mao, Yingke Chen, Manfred Jaeger, Thomas D. Nielsen, Kim G. Larsen, Brian Nielsen
<span title="2016-05-18">2016</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/h4nnd7sxwzcwhetu5qkjbcdh6u" style="color: black;">Machine Learning</a> </i> &nbsp;
In this paper we show how to extend the basic algorithm to also learn automata models for both reactive and timed systems.  ...  In this area of applications, one is often interested in formal model-checking procedures for verifying critical system properties.  ...  In the simplest case, system models are given by finite non-deterministic or probabilistic automata, but model-checking techniques have also been developed for more sophisticated system models, e.g., timed  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10994-016-5565-9">doi:10.1007/s10994-016-5565-9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/i3o46gz3irhkhlrf6fljayokky">fatcat:i3o46gz3irhkhlrf6fljayokky</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190313182548/https://core.ac.uk/download/pdf/60658235.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/50/66/5066a106a917a877161d5d9a471c152233ab94bb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10994-016-5565-9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Splitting trees and partition refinement in real-time model checking

R.F.L. Spelberg, W.J. Toetenel
<i title="IEEE Comput. Soc"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zlnwsi4sefbkvlcgv2zcupjqum" style="color: black;">Proceedings of the 35th Annual Hawaii International Conference on System Sciences</a> </i> &nbsp;
This paper discusses model checking of real-time systems. A novel aspect of our approach is the unconventional approach to deal with representing symbolic state spaces.  ...  Unlike often used canonical representations, this representation is tailored for the type of exploration algorithm that we apply, namely an algorithm based on partition refinement.  ...  SPIN is applied in the context of reactive systems with infinite behaviour. SMV Tree Logic, the branching time temporal logic counter part of PLTL.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/hicss.2002.994478">doi:10.1109/hicss.2002.994478</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/hicss/SpelbergT02.html">dblp:conf/hicss/SpelbergT02</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6xeebkmtarepngtcoigyvf54xa">fatcat:6xeebkmtarepngtcoigyvf54xa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170831073826/https://www.computer.org/csdl/proceedings/hicss/2002/1435/09/14350278.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/70/ab/70ab546172658595576729278fd377549874ee9b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/hicss.2002.994478"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

COST IC1404 WG1 Deliverable WG1.1: State-of-the-art on Current Formalisms used in Cyber-Physical Systems Development

Stefan Klikovits, Rima Al-Ali, Moussa Amrani, Ankica Barisic, Fernando Barros, Dominique Blouin, Etienne Borde, Didier Buchs, Holger Giese, Miguel Goulao, Mauro Iacono, Florin Leon (+3 others)
<span title="2019-01-07">2019</span> <i title="Zenodo"> Zenodo </i> &nbsp;
Deliverable WG1.1 of working group 1 on foundations for multi-paradigm modeling for cyber-physical systems.  ...  It consists of a catalog of formalisms, modelling languages and tools for cyberphysical systems development.  ...  by MathWorks for control logic modeling of reactive systems via state machines and flow charts within a Simulink model.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5281/zenodo.2538711">doi:10.5281/zenodo.2538711</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/itthyvenhfhmdn3f3jap7yf42y">fatcat:itthyvenhfhmdn3f3jap7yf42y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201227222739/https://zenodo.org/record/2538711/files/state_of_art_formalisms_cps_dev_V3.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/24/9f/249ff0a5c7557fc19fc65461d630309ac80e13e7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5281/zenodo.2538711"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> zenodo.org </button> </a>

Synthesis of fault-tolerant concurrent programs

Paul C. Attie, Anish Arora, E. Allen Emerson
<span title="2004-01-01">2004</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4hplau6wtnhnfnqt2t7vbri6vm" style="color: black;">ACM Transactions on Programming Languages and Systems</a> </i> &nbsp;
A serious drawback of extant synthesis methods, however, is that they produce concurrent programs for models of computation that are often unrealistic.  ...  In this case, we say that M is a model of f . We say that a formula f is valid if and only if M , s |= f for all structures M and states s of M .  ...  The idea of relativized satisfaction comes from Emerson and Lei [1985] where it was used to handle fairness in CTL model checking.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/963778.963782">doi:10.1145/963778.963782</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kqij2lg5hbbc7dfztipp6snxhi">fatcat:kqij2lg5hbbc7dfztipp6snxhi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100629023630/http://ceti.cse.ohio-state.edu/siefast/group/publications/attie2004toplas.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/49/cd/49cddafb3e1533329ecf3ea82ed91ea758e0442e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/963778.963782"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Synthesis of fault-tolerant concurrent programs

Anish Arora, Paul C. Attie, E. Allen Emerson
<span title="">1998</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/t5fzg7fyy5byfdcl2vrzbn43ty" style="color: black;">Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC &#39;98</a> </i> &nbsp;
A serious drawback of extant synthesis methods, however, is that they produce concurrent programs for models of computation that are often unrealistic.  ...  In this case, we say that M is a model of f . We say that a formula f is valid if and only if M , s |= f for all structures M and states s of M .  ...  The idea of relativized satisfaction comes from Emerson and Lei [1985] where it was used to handle fairness in CTL model checking.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/277697.277729">doi:10.1145/277697.277729</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/podc/AroraAE98.html">dblp:conf/podc/AroraAE98</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/btvzincqdvbn5oxef6n6wwdnde">fatcat:btvzincqdvbn5oxef6n6wwdnde</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100629023630/http://ceti.cse.ohio-state.edu/siefast/group/publications/attie2004toplas.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/49/cd/49cddafb3e1533329ecf3ea82ed91ea758e0442e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/277697.277729"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A foundation for the design and analysis of robotic systems and behaviors

Zhenhai Zhang
<span title="">1994</span>
We develop a formal verification method for timed V-automata specification, by combining a generalized model checking technique for automata with a generalized stability analysis method for dynamic systems  ...  We develop a semantic model for dynamic systems, that we call Constraint Nets (CN). CN introduces an abstraction and a unitary framework to model discrete/continuous hybrid systems.  ...  PLTL is a basic form of modal linear time temporal logic. It has been shown that model checking for PLTL is linear in the size of the model [LP85]. Various timed extensions are based on PLTL.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14288/1.0051644">doi:10.14288/1.0051644</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/woxsdkeigvemvnecunczpmnsr4">fatcat:woxsdkeigvemvnecunczpmnsr4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200210153102/https://open.library.ubc.ca/media/download/pdf/831/1.0051644/1" 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/7e/4a/7e4ad697988fdc456a8176751f30809f128d4122.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14288/1.0051644"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

State-of-the-art on evolution and reactivity

José Júlio Alferes, James Bailey, Mikael Berndtsson, François Bry, Jens Dietrich, Alexander Kozlenkov, Wolfgang May, Paula Lavinia Patrânjan, Alexandre Pinto, Michael Schroeder, Gerd Wagner
<span title="">2004</span>
More precisely: in Chapter 2 we give an overview of logics for reasoning about state change and updates; Chapter 3 is devoted to briefly describing existing update languages for the Web, and also for updating  ...  logic programs; in Chapter 4 event-condition-action rules, both in the context of active database systems and in the context of semistructured data, are surveyed; in Chapter 5 we give an overview of some  ...  Acknowledgements We would like to thank Thomas Eiter and Gerd Wagner, who acted as cross readers of this deliverable, for their valuable comments on a previous version of this document, which really helped  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5282/ubm/epub.14881">doi:10.5282/ubm/epub.14881</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yrnbsxrnqzhctpqtmnh32w6n6e">fatcat:yrnbsxrnqzhctpqtmnh32w6n6e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170813043621/https://epub.ub.uni-muenchen.de/14881/1/bry_14881.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/9c/28/9c289a0581910ae771af16394b8f873c5a1e123a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5282/ubm/epub.14881"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 21 results