Filters








30,472 Hits in 2.5 sec

Distributed Automata and Logic [article]

Fabian Reiter
<span title="2018-05-16">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this thesis, we provide similar logical characterizations for two more expressive classes of distributed automata.  ...  Distributed automata are finite-state machines that operate on finite directed graphs.  ...  They are motivated by the above characterizations of local distributed automata in terms of (backward) modal logic and .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1805.06238v1">arXiv:1805.06238v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6cdcn5fkszae5c4qeqs5elhdga">fatcat:6cdcn5fkszae5c4qeqs5elhdga</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200910190338/https://arxiv.org/pdf/1805.06238v1.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/32/97/32975e19c9c87667d8a6269734b1779ac58ed34b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1805.06238v1" 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>

Distributed Graph Automata

Fabian Reiter
<span title="">2015</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cnybbxuptncftdgxtodn5edz7m" style="color: black;">2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science</a> </i> &nbsp;
Combining ideas from distributed algorithms and alternating automata, we introduce a new class of finite graph automata that recognize precisely the languages of finite graphs definable in monadic second-order  ...  As an application, we suggest how suitable graph automata might be useful in formal verification of distributed algorithms, using Floyd-Hoare logic.  ...  Their combined expertise was especially helpful for the part about verification of distributed algorithms.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/lics.2015.27">doi:10.1109/lics.2015.27</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/lics/Reiter15.html">dblp:conf/lics/Reiter15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bu53ore6lfewtd274d2tpfoxdm">fatcat:bu53ore6lfewtd274d2tpfoxdm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190218022327/http://pdfs.semanticscholar.org/09f2/192b4c709678b7537bf69730403a398bb84c.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/09/f2/09f2192b4c709678b7537bf69730403a398bb84c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/lics.2015.27"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Modal Logic and Distributed Message Passing Automata

Antti Kuusisto
<span class="release-stage">unpublished</span>
In a recent article, Lauri Hella and co-authors identify a canonical connection between modal logic and deterministic distributed constant-time algorithms.  ...  The paper reports a variety of highly natural logical characterizations of classes of distributed message passing automata that run in constant time.  ...  The reason behind the choice here is mainly technical, and related to the technical relationship between message passing automata and modal logic.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fn3z6aa3hvcktavnp7mefqctnu">fatcat:fn3z6aa3hvcktavnp7mefqctnu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180513081026/http://drops.dagstuhl.de/opus/volltexte/2013/4213/pdf/33.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/b6/ef/b6efe0de238dd19df7ab21a71046b841a3a5ae44.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Implementing cellular automata in FPGA logic

M. Halbach, R. Hoffmann
<i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/t3x4vqewrncrfgn2wu7cafsbsq" style="color: black;">18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.</a> </i> &nbsp;
Delete the update-phase by using two pointers, which point to A and B in one computation and interchange the pointers for the next computation.  ...  Speed (10) % used chip area # used logic cells max. MHz time per cell op.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ipdps.2004.1303324">doi:10.1109/ipdps.2004.1303324</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/ipps/HalbachH04.html">dblp:conf/ipps/HalbachH04</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7krkeuv635dijo5twkuddgt4te">fatcat:7krkeuv635dijo5twkuddgt4te</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809234543/https://www.ra.informatik.tu-darmstadt.de/fileadmin/user_upload/Group_RA/papers/wmpp2004-slides.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/f5/03/f5034855ce99ba79e148d3b411246271c422a7d3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ipdps.2004.1303324"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Deriving Parameter Conditions for Periodic Timed Automata Satisfying Real-time Temporal Logic Formulas [chapter]

Akio Nakata, Teruo Higashino
<i title="Kluwer Academic Publishers"> Formal Techniques for Networked and Distributed Systems </i> &nbsp;
Keywords: A symbolic model checking method for parametric periodic timed automata is proposed.  ...  given temporal properties written in a real-time temporal logic formula. symbolic model checking, real-time periodic system, temporal logic *  ...  the logic formula.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/0-306-47003-9_10">doi:10.1007/0-306-47003-9_10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/deavztulbzdffp53fejjap64nu">fatcat:deavztulbzdffp53fejjap64nu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180725122356/https://link.springer.com/content/pdf/10.1007%2F0-306-47003-9_10.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/65/c2/65c2a301849e4cb43fc31c071ed033a89942a9cd.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/0-306-47003-9_10"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Visual formal specification using (N)TLcharts: statechart automata with temporal logic and natural language conditioned transitions

D. Drusinsky
<i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/t3x4vqewrncrfgn2wu7cafsbsq" style="color: black;">18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.</a> </i> &nbsp;
) Temporal Logic (LTL and MTL).  ...  We provide an informal semantics for TLCharts using nondeterministic automata with negation and overlapping states.  ...  Introduction Temporal Logic is a special branch of modal logic that investigates the notion of time and order.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ipdps.2004.1303343">doi:10.1109/ipdps.2004.1303343</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/ipps/Drusinsky04.html">dblp:conf/ipps/Drusinsky04</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/47sk7q5pezdntfdrt6xg6vzzky">fatcat:47sk7q5pezdntfdrt6xg6vzzky</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808205008/http://faculty.nps.edu/ddrusins%5CDocuments%5CR-Conf11.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/51/3e/513ed364e8b2e27b6ede8acc6aaa6e685e04cc6c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ipdps.2004.1303343"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Games, Automata, Logics and Formal Verification (GandALF 2014) – Preface

Adriano Peron, Carla Piazza
<span title="">2017</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;
logic on graphs), and automata theory (Parametric Timed Automata, Automata for unordered unranked trees,Tree trasducers).  ...  The GandALF symposium was established by a number of Italian computer scientists interested in mathematical logic, automata theory, game theory, and their applications to the specification, design, and  ...  The paper Complexity of Validity for Propositional Dependence Logics, by Jonni Virtema, studies the complexity of the validity problems of propositional dependence logic, modal dependence logic, and extended  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ic.2016.07.005">doi:10.1016/j.ic.2016.07.005</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4oiouzxwcfh2vfuktawrvodnmu">fatcat:4oiouzxwcfh2vfuktawrvodnmu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190323113704/https://core.ac.uk/download/pdf/80136494.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/72/17/7217bccfb272829476e6f38b1d2982f5031986e7.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.2016.07.005"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Automata theory based on quantum logic: some characterizations

Daowen Qiu
<span title="">2004</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;
Automata theory based on quantum logic (abbr. l-valued automata theory) may be viewed as a logical approach of quantum computation.  ...  In this paper, we characterize some fundamental properties of l-valued automata theory, and discover that some properties of the truth-value lattices of the underlying logic are equivalent to certain properties  ...  Acknowledgments The author is very grateful to Professor Arto Salomaa, Editor, and the referee for invaluable suggestions and comments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ic.2003.11.003">doi:10.1016/j.ic.2003.11.003</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2liie5kjlfbjnojr4mg35ejqyi">fatcat:2liie5kjlfbjnojr4mg35ejqyi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190413070144/https://core.ac.uk/download/pdf/82736711.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/ab/49/ab4960ab4c6f67db45a810dc96aa7d372aae734a.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.2003.11.003"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Page 5447 of Mathematical Reviews Vol. , Issue 88j [page]

<span title="">1988</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
(D-TUB) Grammars for terms and automata. On a book by the late J. Richard Bichi. Computation theory and logic, 349-359, Lecture Notes in Comput. Sci., 270, Springer, Berlin-New York, 1987.  ...  From the introduction: “A great deal of work has so far gone into developing temporal logic as a tool for specifying and proving the properties of distributed programs.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1988-10_88j/page/5447" title="read fulltext microfilm" 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> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1988-10_88j/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Preface for the special issue GandALF 2015

Javier Esparza, Enrico Tronci
<span title="2018-02-01">2018</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cnqseeosvrf6tnj6sc3lbn2y4e" style="color: black;">Acta Informatica</a> </i> &nbsp;
The International Symposium on Games, Automata, Logics and Formal Verification (Gan-dALF) was founded in 2010 by a number of Italian computer scientists interested in mathematical logic, automata theory  ...  The programme consisted of 13 presentations on algorithmic game theory, automata theory, formal verification, and modal and temporal logics.  ...  The International Symposium on Games, Automata, Logics and Formal Verification (Gan-dALF) was founded in 2010 by a number of Italian computer scientists interested in mathematical logic, automata theory  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00236-018-0315-z">doi:10.1007/s00236-018-0315-z</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/n26s76iwmzdxxclfuesecazq3m">fatcat:n26s76iwmzdxxclfuesecazq3m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20181030094344/https://link.springer.com/content/pdf/10.1007%2Fs00236-018-0315-z.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/f4/41/f441f634a719d19db20d94cab04d30b1d163e3c9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00236-018-0315-z"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Analog Logic Automata

Kailiang Chen, Jonathan Leu, Neil Gershenfeld
<span title="">2008</span> <i title="IEEE"> 2008 IEEE Biomedical Circuits and Systems Conference </i> &nbsp;
Logic Automata are distributed, scalable and programmable digital computation media with local connections and logic operations.  ...  Here we propose Analog Logic Automata (ALA), which relax binary constraints on Logic Automata states and introduce programmability into Analog Logic circuits.  ...  Rahul Sarpeshkar and Soumyajit Mandal for their support in chip fabrication and testing; Luis Lafuente and David Dalrymple for discussion on theoretical analysis; Ara Knaian, David Kopp, and Forrest Green  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/biocas.2008.4696906">doi:10.1109/biocas.2008.4696906</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gx6ufasj3zayhhzjvw6utcj2te">fatcat:gx6ufasj3zayhhzjvw6utcj2te</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100626045851/http://phm.cba.mit.edu/papers/08.09.ChenLeu.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/be/4e/be4e31e3b24d72e8198f25fd7822ba6546d08626.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/biocas.2008.4696906"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Page 6323 of Mathematical Reviews Vol. , Issue 93k [page]

<span title="">1993</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
In the first part of the paper we give a logical characterization of the ‘Rabin-recognizable relations’ (whose associated tree languages are recognized by Rabin tree automata) in terms of ‘weak chain logic  ...  We describe the class of relations over w- words which (in the tree language representation) are definable in this logic, and show that the theory of the k-ary tree in this logic is decidable.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1993-11_93k/page/6323" title="read fulltext microfilm" 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> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1993-11_93k/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Page 7076 of Mathematical Reviews Vol. , Issue 99j [page]

<span title="">1999</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Temporal logics and fixed-point logics took the role of the specification languages (replacing first-order and monadic second-order logic), and more efficient transformations from logic formulas to automata  ...  Later, in work of Biichi, McNaughton, and Rabin, such an equivalence was shown also between finite automata and monadic second-order logic over infinite words and trees.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1999-10_99j/page/7076" title="read fulltext microfilm" 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> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1999-10_99j/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Weighted Automata and Logics for Infinite Nested Words [chapter]

Manfred Droste, Stefan Dück
<span title="">2014</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;
Here, we will introduce and investigate weighted automata models and weighted MSO logics for infinite nested words.  ...  Furthermore, Alur and Madhusudan introduced automata and equivalent logics for both finite and infinite nested words, thus extending B\"uchi's theorem to nested words.  ...  Automata and Logics for Nested ω-Words In this section we describe basic background for classical (unweighted) automata and logics on nested-ω-words.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-04921-2_26">doi:10.1007/978-3-319-04921-2_26</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xelyg6ja6vfujevy7snshwpvbi">fatcat:xelyg6ja6vfujevy7snshwpvbi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191015040036/https://arxiv.org/pdf/1506.07031v1.pdf" title="fulltext PDF download [not primary version]" 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] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/4c/c6/4cc67320f351744e3e5de9f7ed90efeb97cc6269.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-04921-2_26"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Page 574 of Mathematical Reviews Vol. , Issue 2003A [page]

<span title="">2003</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Temporal logic is a widely acknowledged language for the specification and verification of concurrent systems. Stabilization is a vitally emerging paradigm in fault tolerant distributed computing.  ...  Summary: “This paper presents z-logic, an action-based logic for z-calculus. A model checker is built for this logic, following an automata-based approach.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2003-01_2003a/page/574" title="read fulltext microfilm" 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> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_2003-01_2003a/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 30,472 results