Specifying reversibility with TLA+
In the past, action-based, process-algebraic formalisms for the description and analysis of concurrent reversible computations were mainly developed. In this paper, we present a state-based approach to the specification of concurrent systems in which forward-executed actions may either be executed i...
Saved in:
| Published in | Journal of logical and algebraic methods in programming Vol. 116; p. 100582 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier Inc
01.11.2020
|
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | In the past, action-based, process-algebraic formalisms for the description and analysis of concurrent reversible computations were mainly developed. In this paper, we present a state-based approach to the specification of concurrent systems in which forward-executed actions may either be executed in reverse in a causal-consistent uncontrolled fashion or are irreversible. The basic underlying system semantics is assumed to be a set of possible infinite sequences of states with actions defined as state transitions, which allows us to specify reversibility with the specification language TLA+ and to use its tool support for specification editing and verification. We provide definitions of TLA+ operators for the specification of causal-consistent reversibility and irreversible actions in a uniform way. The reversibility is achieved by remembering as much computation history as necessary with regard to the irreversible actions. The applicability of the approach is illustrated with examples, including the modelling of the influence of the Raf kinase inhibitor protein on the extracellular signal-regulated kinase signalling pathway and parameterised specification of a system of dining philosophers. |
|---|---|
| AbstractList | In the past, action-based, process-algebraic formalisms for the description and analysis of concurrent reversible computations were mainly developed. In this paper, we present a state-based approach to the specification of concurrent systems in which forward-executed actions may either be executed in reverse in a causal-consistent uncontrolled fashion or are irreversible. The basic underlying system semantics is assumed to be a set of possible infinite sequences of states with actions defined as state transitions, which allows us to specify reversibility with the specification language TLA+ and to use its tool support for specification editing and verification. We provide definitions of TLA+ operators for the specification of causal-consistent reversibility and irreversible actions in a uniform way. The reversibility is achieved by remembering as much computation history as necessary with regard to the irreversible actions. The applicability of the approach is illustrated with examples, including the modelling of the influence of the Raf kinase inhibitor protein on the extracellular signal-regulated kinase signalling pathway and parameterised specification of a system of dining philosophers. |
| ArticleNumber | 100582 |
| Author | Kapus, Tatjana |
| Author_xml | – sequence: 1 givenname: Tatjana orcidid: 0000-0003-3228-3941 surname: Kapus fullname: Kapus, Tatjana email: tatjana.kapus@um.si organization: University of Maribor, Faculty of Electrical Engineering and Computer Science, Koroška c. 46, SI-2000 Maribor, Slovenia |
| BookMark | eNp9jz1PwzAQhj0UiVL6C1giVpRwthPHGRiqii8pEgNlthznDI7SJLKjov57EsLMdNLpfd6754qsur5DQm4oJBSouG-SptXHIWHA5g1kkq3ImvGMxYyBvCTbEBqAKSpzyema3L4PaJw9u-4z8nhCH1zlWjeeo283fkWHcnd3TS6sbgNu_-aGfDw9HvYvcfn2_LrflbFhGR_j3FaVlMV0Oa1yY6u8qMFIStGKWhqpsQCRwhQtNOZM6JRbgyZL61RkUBvBN4Qvvcb3IXi0avDuqP1ZUVCznWrUr52a7dRiN1EPC4XTayeHXgXjsDNYO49mVHXv_uV_AN_hW60 |
| Cites_doi | 10.1145/78969.78970 10.1142/S0218126606003416 10.1016/0304-3975(89)90169-2 10.1006/jcss.2001.1817 10.1016/j.jlap.2006.11.002 10.1016/0304-3975(91)90224-P 10.1016/j.entcs.2010.02.007 10.1145/177492.177726 10.1145/186025.186058 |
| ContentType | Journal Article |
| Copyright | 2020 Elsevier Inc. |
| Copyright_xml | – notice: 2020 Elsevier Inc. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.jlamp.2020.100582 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| ExternalDocumentID | 10_1016_j_jlamp_2020_100582 S2352220820300675 |
| GroupedDBID | --M 0R~ 4.4 457 4G. 7-5 8P~ AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAXUO AAYFN ABBOA ABMAC ABVKL ABXDB ABYKQ ACDAQ ACGFS ACRLP ADBBV ADEZE AEBSH AEKER AENEX AFKWA AFTJW AGHFR AGUBO AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD AXJTR BKOJK BLXMC EBS EFJIC EFLBG EJD FDB FIRID FYGXN GBLVA GBOLZ HZ~ KOM M41 NCXOZ O9- OAUVE RIG ROL SPC SPCBC SSV SSZ T5K ~G- AATTM AAXKI AAYWO AAYXX ABJNI ACVFH ADCNI ADVLN AEIPS AEUPX AFJKZ AFPUW AFXIZ AGCQF AGRNS AIGII AIIUN AKBMS AKRWK AKYEP ANKPU BNPGV CITATION SSH |
| ID | FETCH-LOGICAL-c253t-7fbb8892024b7cfb79d0c811ef6d8c8ae906402539ae726a43fcec54d4650dc63 |
| IEDL.DBID | AIKHN |
| ISSN | 2352-2208 |
| IngestDate | Tue Jul 01 00:37:50 EDT 2025 Fri Feb 23 02:48:51 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Model checking Concurrent system Reversible computation Temporal logic of actions |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c253t-7fbb8892024b7cfb79d0c811ef6d8c8ae906402539ae726a43fcec54d4650dc63 |
| ORCID | 0000-0003-3228-3941 |
| ParticipantIDs | crossref_primary_10_1016_j_jlamp_2020_100582 elsevier_sciencedirect_doi_10_1016_j_jlamp_2020_100582 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | November 2020 2020-11-00 |
| PublicationDateYYYYMMDD | 2020-11-01 |
| PublicationDate_xml | – month: 11 year: 2020 text: November 2020 |
| PublicationDecade | 2020 |
| PublicationTitle | Journal of logical and algebraic methods in programming |
| PublicationYear | 2020 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Cho, Shin, Kim, Wolkenhauer, McFerrain, Kolch (br0220) 2003; vol. 2602 Kapus (br0130) 2006; 15 Lamport (br0080) 1994; 16 Gafni, Naor, Ragde (br0150) 1989; 68 Bernadet, Lanese (br0230) 2016; vol. 223 Diekert, Gastin (br0160) 2002; 64 Kröger (br0320) 1987 Manna, Pnueli (br0310) 1992 Baier, Katoen (br0290) 2008 (br0330) 2009; vol. 5684 Pinna (br0350) 2018; vol. 10725 Lamport (br0190) 19th April, 2008 Azaiez, Doligez, Lemerre, Libal, Merz (br0140) 2016; vol. 9675 Lamport (br0240) 23rd August, 2018 Phillips, Ulidowski, Yuen (br0370) 2013; vol. 7581 Lamport (br0180) 1990; 12 Lanese, Mezzina, Tiezzi (br0050) 2014; 114 Danos, Krivine (br0060) 2005; vol. 3653 Lanese, Mezzina, Stefani (br0030) 2010; vol. 6269 Yokoyama (br0340) 2010; 253 Abadi (br0100) 2015; vol. 9033 Lamport (br0070) 2002 Best (br0360) 1985; vol. 197 Mazurkiewicz (br0270) 1988; vol. 354 Phillips, Ulidowski (br0020) 2007; 73 Danos, Krivine (br0010) 2004; vol. 3170 Kapus (br0170) 1994 Kleijn, Koutny (br0250) 2008; vol. 113 Abadi, Isard (br0120) 2015; vol. 9058 Abadi, Lamport (br0200) 1994; 16 Calder, Gilmore, Hillston (br0210) 2006; vol. 4230 Perumalla (br0300) 2014 br0090 Abadi, Lamport (br0280) 1991; 82 Lamport, Merz (br0110) 27th May, 2017 Cristescu, Krivine, Varacca (br0040) 2013 Morin (br0260) 2002; vol. 2285 Lanese (10.1016/j.jlamp.2020.100582_br0050) 2014; 114 Lamport (10.1016/j.jlamp.2020.100582_br0110) Phillips (10.1016/j.jlamp.2020.100582_br0370) 2013; vol. 7581 Abadi (10.1016/j.jlamp.2020.100582_br0120) 2015; vol. 9058 Danos (10.1016/j.jlamp.2020.100582_br0010) 2004; vol. 3170 Kröger (10.1016/j.jlamp.2020.100582_br0320) 1987 Diekert (10.1016/j.jlamp.2020.100582_br0160) 2002; 64 Bernadet (10.1016/j.jlamp.2020.100582_br0230) 2016; vol. 223 Kleijn (10.1016/j.jlamp.2020.100582_br0250) 2008; vol. 113 Mazurkiewicz (10.1016/j.jlamp.2020.100582_br0270) 1988; vol. 354 Abadi (10.1016/j.jlamp.2020.100582_br0280) 1991; 82 Cho (10.1016/j.jlamp.2020.100582_br0220) 2003; vol. 2602 Best (10.1016/j.jlamp.2020.100582_br0360) 1985; vol. 197 Azaiez (10.1016/j.jlamp.2020.100582_br0140) 2016; vol. 9675 (10.1016/j.jlamp.2020.100582_br0330) 2009; vol. 5684 Phillips (10.1016/j.jlamp.2020.100582_br0020) 2007; 73 Lanese (10.1016/j.jlamp.2020.100582_br0030) 2010; vol. 6269 Abadi (10.1016/j.jlamp.2020.100582_br0200) 1994; 16 Danos (10.1016/j.jlamp.2020.100582_br0060) 2005; vol. 3653 Lamport (10.1016/j.jlamp.2020.100582_br0070) 2002 Lamport (10.1016/j.jlamp.2020.100582_br0080) 1994; 16 Baier (10.1016/j.jlamp.2020.100582_br0290) 2008 Lamport (10.1016/j.jlamp.2020.100582_br0180) 1990; 12 Lamport (10.1016/j.jlamp.2020.100582_br0240) Gafni (10.1016/j.jlamp.2020.100582_br0150) 1989; 68 Yokoyama (10.1016/j.jlamp.2020.100582_br0340) 2010; 253 Perumalla (10.1016/j.jlamp.2020.100582_br0300) 2014 Cristescu (10.1016/j.jlamp.2020.100582_br0040) 2013 Morin (10.1016/j.jlamp.2020.100582_br0260) 2002; vol. 2285 Calder (10.1016/j.jlamp.2020.100582_br0210) 2006; vol. 4230 Manna (10.1016/j.jlamp.2020.100582_br0310) 1992 Kapus (10.1016/j.jlamp.2020.100582_br0170) 1994 Pinna (10.1016/j.jlamp.2020.100582_br0350) 2018; vol. 10725 Lamport (10.1016/j.jlamp.2020.100582_br0190) Abadi (10.1016/j.jlamp.2020.100582_br0100) 2015; vol. 9033 Kapus (10.1016/j.jlamp.2020.100582_br0130) 2006; 15 |
| References_xml | – volume: vol. 113 start-page: 125 year: 2008 end-page: 182 ident: br0250 article-title: Formal languages and concurrent behaviours publication-title: New Developments in Formal Languages and Applications, Studies in Computational Intelligence – volume: 114 year: 2014 ident: br0050 article-title: Causal-consistent reversibility publication-title: Bull. Eur. Assoc. Theor. Comput. Sci. – volume: vol. 354 start-page: 285 year: 1988 end-page: 363 ident: br0270 article-title: Basic notions of trace theory publication-title: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency – volume: vol. 3170 start-page: 292 year: 2004 end-page: 307 ident: br0010 article-title: Reversible communicating systems publication-title: Proc. 15th Int. Conf. Concurrency Theory – volume: vol. 3653 start-page: 398 year: 2005 end-page: 412 ident: br0060 article-title: Transactions in RCCS publication-title: Proc. 16th Int. Conf. Concurrency Theory – year: 19th April, 2008 ident: br0190 article-title: Computation and state machines – volume: vol. 223 start-page: 98 year: 2016 end-page: 112 ident: br0230 article-title: A modular formalization of reversibility for concurrent models and languages publication-title: Proc. 9th Conf. Interaction and Concurrency Experience – volume: vol. 9675 start-page: 70 year: 2016 end-page: 85 ident: br0140 article-title: Proving determinacy of the PharOS real-time operating system publication-title: Proc. 5th Int. Conf. Abstract State Machines, Alloy, B, TLA, VDM, and Z – volume: vol. 6269 start-page: 478 year: 2010 end-page: 493 ident: br0030 article-title: Reversing higher-order pi publication-title: Proc. 21st Int. Conf. Concurrency Theory – ident: br0090 – volume: 68 start-page: 343 year: 1989 end-page: 346 ident: br0150 article-title: On separating the EREW and CREW PRAM models publication-title: Theor. Comput. Sci. – volume: 16 start-page: 1543 year: 1994 end-page: 1571 ident: br0200 article-title: An old-fashioned recipe for real time publication-title: ACM Trans. Program. Lang. Syst. – volume: vol. 10725 start-page: 245 year: 2018 end-page: 261 ident: br0350 article-title: Reversing steps in membrane systems computations publication-title: Proc. 18th Int. Conf. Membrane Computing – volume: vol. 4230 start-page: 1 year: 2006 end-page: 23 ident: br0210 article-title: Modelling the influence of RKIP on the ERK signalling pathway using the stochastic process algebra PEPA publication-title: Trans. on Comput. Syst. Biol. VII – year: 23rd August, 2018 ident: br0240 article-title: Using TLC to check inductive invariance – volume: vol. 2285 start-page: 523 year: 2002 end-page: 534 ident: br0260 article-title: Recognizable sets of message sequence charts publication-title: Proc. 19th Annual Symp. Theoretical Aspects of Computer Science – volume: 15 start-page: 881 year: 2006 end-page: 906 ident: br0130 article-title: Specification and verification of a parametric handover procedure using TLA publication-title: J. Circuits Syst. Comput. – volume: vol. 5684 start-page: 36 year: 2009 end-page: 60 ident: br0330 article-title: The PlusCal algorithm language publication-title: Theoretical Aspects of Computing – ICTAC 2009 – year: 2014 ident: br0300 article-title: Introduction to Reversible Computing – start-page: 388 year: 2013 end-page: 397 ident: br0040 article-title: A compositional semantics for the reversible pi-calculus publication-title: 28th Annual ACM/IEEE Symp. Logic in Computer Science – volume: 16 start-page: 872 year: 1994 end-page: 943 ident: br0080 article-title: The temporal logic of actions publication-title: ACM Trans. Program. Lang. Syst. – year: 1992 ident: br0310 article-title: The Temporal Logic of Reactive and Concurrent Systems: Specification – volume: vol. 197 start-page: 221 year: 1985 end-page: 245 ident: br0360 article-title: Concurrent behaviour: sequences, processes and axioms publication-title: Seminar on Concurrency – year: 1994 ident: br0170 article-title: True Concurrency Semantics and Correctness of Concurrent Programs – volume: vol. 2602 start-page: 127 year: 2003 end-page: 141 ident: br0220 article-title: Mathematical modeling of the influence of RKIP on the ERK signaling pathway publication-title: Proc. 1st Int. Workshop Computational Methods in Systems Biology – year: 2002 ident: br0070 article-title: Specifying Systems, The TLA – volume: vol. 9058 start-page: 19 year: 2015 end-page: 34 ident: br0120 article-title: Timely rollback: specification and verification publication-title: Proc. 7th Int. Symp. NASA Formal Methods – volume: 253 start-page: 71 year: 2010 end-page: 81 ident: br0340 article-title: Reversible computation and reversible programming languages publication-title: Electron. Notes Theor. Comput. Sci. – year: 27th May, 2017 ident: br0110 article-title: Auxiliary variables in TLA – volume: 64 start-page: 396 year: 2002 end-page: 418 ident: br0160 article-title: LTL is expressively complete for Mazurkiewicz traces publication-title: J. Comput. Syst. Sci. – volume: 12 start-page: 396 year: 1990 end-page: 428 ident: br0180 article-title: win and sin: predicate transformers for concurrency publication-title: ACM Trans. Program. Lang. Syst. – volume: 82 start-page: 253 year: 1991 end-page: 284 ident: br0280 article-title: The existence of refinement mappings publication-title: Theor. Comput. Sci. – volume: 73 start-page: 70 year: 2007 end-page: 96 ident: br0020 article-title: Reversing algebraic process calculi publication-title: J. Log. Algebraic Program. – volume: vol. 9033 start-page: 347 year: 2015 end-page: 361 ident: br0100 article-title: The prophecy of undo publication-title: Proc. 18th Int. Conf. Fundamental Approaches to Software Engineering – year: 2008 ident: br0290 article-title: Principles of Model Checking – year: 1987 ident: br0320 article-title: Temporal Logic of Programs – volume: vol. 7581 start-page: 218 year: 2013 end-page: 232 ident: br0370 article-title: A reversible process calculus and the modelling of the ERK signalling pathway publication-title: Proc. 4th Int. Workshop Reversible Computation – volume: vol. 2285 start-page: 523 year: 2002 ident: 10.1016/j.jlamp.2020.100582_br0260 article-title: Recognizable sets of message sequence charts – volume: vol. 9033 start-page: 347 year: 2015 ident: 10.1016/j.jlamp.2020.100582_br0100 article-title: The prophecy of undo – ident: 10.1016/j.jlamp.2020.100582_br0110 – volume: 12 start-page: 396 year: 1990 ident: 10.1016/j.jlamp.2020.100582_br0180 article-title: win and sin: predicate transformers for concurrency publication-title: ACM Trans. Program. Lang. Syst. doi: 10.1145/78969.78970 – volume: vol. 3653 start-page: 398 year: 2005 ident: 10.1016/j.jlamp.2020.100582_br0060 article-title: Transactions in RCCS – year: 2014 ident: 10.1016/j.jlamp.2020.100582_br0300 – year: 2008 ident: 10.1016/j.jlamp.2020.100582_br0290 – volume: 15 start-page: 881 year: 2006 ident: 10.1016/j.jlamp.2020.100582_br0130 article-title: Specification and verification of a parametric handover procedure using TLA publication-title: J. Circuits Syst. Comput. doi: 10.1142/S0218126606003416 – volume: vol. 9058 start-page: 19 year: 2015 ident: 10.1016/j.jlamp.2020.100582_br0120 article-title: Timely rollback: specification and verification – volume: 68 start-page: 343 year: 1989 ident: 10.1016/j.jlamp.2020.100582_br0150 article-title: On separating the EREW and CREW PRAM models publication-title: Theor. Comput. Sci. doi: 10.1016/0304-3975(89)90169-2 – year: 2002 ident: 10.1016/j.jlamp.2020.100582_br0070 – volume: vol. 9675 start-page: 70 year: 2016 ident: 10.1016/j.jlamp.2020.100582_br0140 article-title: Proving determinacy of the PharOS real-time operating system – volume: 64 start-page: 396 year: 2002 ident: 10.1016/j.jlamp.2020.100582_br0160 article-title: LTL is expressively complete for Mazurkiewicz traces publication-title: J. Comput. Syst. Sci. doi: 10.1006/jcss.2001.1817 – volume: vol. 5684 start-page: 36 year: 2009 ident: 10.1016/j.jlamp.2020.100582_br0330 article-title: The PlusCal algorithm language – volume: 73 start-page: 70 year: 2007 ident: 10.1016/j.jlamp.2020.100582_br0020 article-title: Reversing algebraic process calculi publication-title: J. Log. Algebraic Program. doi: 10.1016/j.jlap.2006.11.002 – year: 1994 ident: 10.1016/j.jlamp.2020.100582_br0170 – volume: 82 start-page: 253 year: 1991 ident: 10.1016/j.jlamp.2020.100582_br0280 article-title: The existence of refinement mappings publication-title: Theor. Comput. Sci. doi: 10.1016/0304-3975(91)90224-P – volume: vol. 223 start-page: 98 year: 2016 ident: 10.1016/j.jlamp.2020.100582_br0230 article-title: A modular formalization of reversibility for concurrent models and languages – volume: vol. 7581 start-page: 218 year: 2013 ident: 10.1016/j.jlamp.2020.100582_br0370 article-title: A reversible process calculus and the modelling of the ERK signalling pathway – start-page: 388 year: 2013 ident: 10.1016/j.jlamp.2020.100582_br0040 article-title: A compositional semantics for the reversible pi-calculus – ident: 10.1016/j.jlamp.2020.100582_br0190 – volume: vol. 4230 start-page: 1 year: 2006 ident: 10.1016/j.jlamp.2020.100582_br0210 article-title: Modelling the influence of RKIP on the ERK signalling pathway using the stochastic process algebra PEPA – volume: 253 start-page: 71 year: 2010 ident: 10.1016/j.jlamp.2020.100582_br0340 article-title: Reversible computation and reversible programming languages publication-title: Electron. Notes Theor. Comput. Sci. doi: 10.1016/j.entcs.2010.02.007 – volume: vol. 113 start-page: 125 year: 2008 ident: 10.1016/j.jlamp.2020.100582_br0250 article-title: Formal languages and concurrent behaviours – volume: 16 start-page: 872 year: 1994 ident: 10.1016/j.jlamp.2020.100582_br0080 article-title: The temporal logic of actions publication-title: ACM Trans. Program. Lang. Syst. doi: 10.1145/177492.177726 – volume: vol. 354 start-page: 285 year: 1988 ident: 10.1016/j.jlamp.2020.100582_br0270 article-title: Basic notions of trace theory – year: 1992 ident: 10.1016/j.jlamp.2020.100582_br0310 – volume: vol. 197 start-page: 221 year: 1985 ident: 10.1016/j.jlamp.2020.100582_br0360 article-title: Concurrent behaviour: sequences, processes and axioms – year: 1987 ident: 10.1016/j.jlamp.2020.100582_br0320 – volume: vol. 2602 start-page: 127 year: 2003 ident: 10.1016/j.jlamp.2020.100582_br0220 article-title: Mathematical modeling of the influence of RKIP on the ERK signaling pathway – ident: 10.1016/j.jlamp.2020.100582_br0240 – volume: vol. 6269 start-page: 478 year: 2010 ident: 10.1016/j.jlamp.2020.100582_br0030 article-title: Reversing higher-order pi – volume: 114 year: 2014 ident: 10.1016/j.jlamp.2020.100582_br0050 article-title: Causal-consistent reversibility publication-title: Bull. Eur. Assoc. Theor. Comput. Sci. – volume: 16 start-page: 1543 year: 1994 ident: 10.1016/j.jlamp.2020.100582_br0200 article-title: An old-fashioned recipe for real time publication-title: ACM Trans. Program. Lang. Syst. doi: 10.1145/186025.186058 – volume: vol. 3170 start-page: 292 year: 2004 ident: 10.1016/j.jlamp.2020.100582_br0010 article-title: Reversible communicating systems – volume: vol. 10725 start-page: 245 year: 2018 ident: 10.1016/j.jlamp.2020.100582_br0350 article-title: Reversing steps in membrane systems computations |
| SSID | ssj0001687831 |
| Score | 2.1396387 |
| Snippet | In the past, action-based, process-algebraic formalisms for the description and analysis of concurrent reversible computations were mainly developed. In this... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 100582 |
| SubjectTerms | Concurrent system Model checking Reversible computation Temporal logic of actions |
| Title | Specifying reversibility with TLA+ |
| URI | https://dx.doi.org/10.1016/j.jlamp.2020.100582 |
| Volume | 116 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07a8MwED7SZOnSd2n6wpRurUkt6-UxhIb0QZYmkE1YsgTJkIaQDP331ckybaF06GjjA_mTdA_puzuAWyE1MhN9pIp1hqgPv_yWsibN_PpxLiOmqEK1zzEfTenzjM1aMGhyYZBWGXV_rdODto5vehHN3mo-770R9B0ImrAcdS7bgQ7JC-6Xdqf_9DIafx21cClk6EyIIinKNPWHAtNr4bHH0pUkcAaYJL_bqG92Z3gAe9FhTPr1mA6hZZdHsN80Y0ji3jyGm9BJPmQtJViWaR15rx8JHrUmk9f-3QlMh4-TwSiNDRBSQ1i-SYXTWsrCj4xqYZwWRfVgZJZZxytpZGkLvIfznxalFYSXNHfGGkYr6v2uyvD8FNrL96U9g0RaK2XpfDRsDJ76lIxmVthceINPmDZduG9-Wa3qOheqIYAtVEBIIUKqRqgLvIFF_Zgu5TXxX4Ln_xW8gF18qtMAL6G9WW_tlfcHNvo6zvcnixKwFw |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwED6VdoCFN6I8I8QGUYljx85YVVQpLV1opW5W7DhSO7RVVQb-PT7HESAhBtYkJznn-F757juAey4UIhNtpoo8Q9SmX_ZIGR1G9vspy4jotHBsn-Mkm9KXGZs1oFf3wiCs0tv-yqY7a-2vdLw2O-v5vPNGMHYg6MJitLlsB1rITsWa0OoOhtn4q9SSCC7cZEIUCVGm5h9ySK-F1T1SVxKHGWCC_O6jvvmd_iHs-4Ax6FZrOoKGWR7DQT2MIfBn8wTu3CR517UUIC3TxuNePwIstQaTUffhFKb950kvC_0AhFATFm9DXiolRGpXRhXXpeJp8aRFFJkyKYQWuUnxP5x9NM0NJ0lO41IbzWhBbdxV6CQ-g-ZytTTnEAhjhMhLmw1rjVWfnNHIcBNz6_AJU7oNj_Ury3XFcyFrANhCOg1J1JCsNNSGpFaL_LFd0lrivwQv_it4C7vZ5HUkR4Px8BL28E7VEngFze3m3Vzb2GCrbvzefwLk1bL9 |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Specifying+reversibility+with+TLA%2B&rft.jtitle=Journal+of+logical+and+algebraic+methods+in+programming&rft.au=Kapus%2C+Tatjana&rft.date=2020-11-01&rft.issn=2352-2208&rft.volume=116&rft.spage=100582&rft_id=info:doi/10.1016%2Fj.jlamp.2020.100582&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_jlamp_2020_100582 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2352-2208&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2352-2208&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2352-2208&client=summon |