Verification of distributed systems with the axiomatic system of MSVL

Since distributed systems are inherently concurrent and asynchronous, it is a challenge for us to verify distributed systems. MSVL is a useful temporal logic programming language and its axiomatic system has been established. However, the axiomatic system of MSVL lacks mechanisms to manage asynchron...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Formal aspects of computing Ročník 27; číslo 1; s. 103 - 131
Hlavní autoři:	Ma, Qian, Duan, Zhenhua, Zhang, Nan, Wang, Xiaobing
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	London Springer London 01.01.2015 Association for Computing Machinery
Témata:	Algorithms Axioms Communication systems Completeness Computation Computer networks Computer Science Math Applications in Computer Science Original Article Programming languages Temporal logic Theory of Computation MSVL Temporal logic programming Distributed systems Theorem proving Temporal logic
ISSN:	0934-5043, 1433-299X
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	Since distributed systems are inherently concurrent and asynchronous, it is a challenge for us to verify distributed systems. MSVL is a useful temporal logic programming language and its axiomatic system has been established. However, the axiomatic system of MSVL lacks mechanisms to manage asynchronous communication, which makes it cannot deal with distributed systems. Thus, to verify distributed systems with MSVL in a deductive way, this paper is motivated to extend the axiomatic system of MSVL with new axioms for asynchronous communication. To this end, firstly we formalize state axioms regarding asynchronous communication commands and then prove the soundness and completeness. Further, to demonstrate how the extended axiomatic system of MSVL works for distributed systems, we apply it to the well-known Ricart–Agrawala (RA) algorithm, which is a distributed mutual exclusion algorithm and has an infinite state space. To do this, we model the RA algorithm with MSVL, specify the desired properties and then verify an instance of the RA algorithm with respect to the first-come-first-served property.
AbstractList	Since distributed systems are inherently concurrent and asynchronous, it is a challenge for us to verify distributed systems. MSVL is a useful temporal logic programming language and its axiomatic system has been established. However, the axiomatic system of MSVL lacks mechanisms to manage asynchronous communication, which makes it cannot deal with distributed systems. Thus, to verify distributed systems with MSVL in a deductive way, this paper is motivated to extend the axiomatic system of MSVL with new axioms for asynchronous communication. To this end, firstly we formalize state axioms regarding asynchronous communication commands and then prove the soundness and completeness. Further, to demonstrate how the extended axiomatic system of MSVL works for distributed systems, we apply it to the well-known Ricart–Agrawala (RA) algorithm, which is a distributed mutual exclusion algorithm and has an infinite state space. To do this, we model the RA algorithm with MSVL, specify the desired properties and then verify an instance of the RA algorithm with respect to the first-come-first-served property. Since distributed systems are inherently concurrent and asynchronous, it is a challenge for us to verify distributed systems. MSVL is a useful temporal logic programming language and its axiomatic system has been established. However, the axiomatic system of MSVL lacks mechanisms to manage asynchronous communication, which makes it cannot deal with distributed systems. Thus, to verify distributed systems with MSVL in a deductive way, this paper is motivated to extend the axiomatic system of MSVL with new axioms for asynchronous communication. To this end, firstly we formalize state axioms regarding asynchronous communication commands and then prove the soundness and completeness. Further, to demonstrate how the extended axiomatic system of MSVL works for distributed systems, we apply it to the well-known Ricart-Agrawala (RA) algorithm, which is a distributed mutual exclusion algorithm and has an infinite state space. To do this, we model the RA algorithm with MSVL, specify the desired properties and then verify an instance of the RA algorithm with respect to the first-come-first-served property.[PUBLICATION ABSTRACT]
Author	Ma, Qian Duan, Zhenhua Zhang, Nan Wang, Xiaobing
Author_xml	– sequence: 1 givenname: Qian surname: Ma fullname: Ma, Qian organization: Institute of Computing Theory and Technology, Xidian University – sequence: 2 givenname: Zhenhua surname: Duan fullname: Duan, Zhenhua email: zhhduan@mail.xidian.edu.cn organization: Institute of Computing Theory and Technology, Xidian University – sequence: 3 givenname: Nan surname: Zhang fullname: Zhang, Nan organization: Institute of Computing Theory and Technology, Xidian University – sequence: 4 givenname: Xiaobing surname: Wang fullname: Wang, Xiaobing organization: Institute of Computing Theory and Technology, Xidian University
BookMark	eNp9kMtKAzEUQINUsK1-gLsBN26iuZPMaymlPqDiQi3uQjJJbMo8apKi_XtnnC6koKsscs69lzNBo6ZtNELnQK6AkOzaEwJpggkwTCihGI7QGBilOC6KtxEak4IynBBGT9DE-3VHJwXAGM2X2lljSxFs20StiZT1wVm5DVpFfueDrn30acMqCisdiS_b1h1a7r964fF5uThFx0ZUXp_t3yl6vZ2_zO7x4unuYXazwCWLk4BZlpKc0ljmNAdTpgqoLKRJdFqITDElZKIUCM0kAUONVErkmckKo3IZy1LSKboc5m5c-7HVPvDa-lJXlWh0u_Uc0pSQHIpuyRRdHKDrduua7rqOYgBZQpOegoEqXeu904ZvnK2F23EgvA_Lh7C8C8v7sBw6JztwSht--gUnbPWvGQ-m77Y079r9uulP6RvjGI6r
CODEN	FACME5
CitedBy_id	crossref_primary_10_1016_j_tcs_2020_05_009 crossref_primary_10_1016_j_scico_2020_102438
Cites_doi	10.1109/TSE.1983.235434 10.1016/j.scico.2011.03.007 10.1145/177492.177726 10.1090/conm/029 10.1145/356698.356702 10.1017/CBO9780511611063 10.1017/S0960129510000241 10.1145/1721654.1721672 10.1145/358527.358537 10.1145/359576.359585 10.1007/978-1-4612-0931-7 10.1109/TSE.2012.73 10.1007/978-3-642-24559-6_8 10.5555/128869 10.5555/1199324 10.1145/1592434.1592436 10.1007/978-3-540-88194-0_12 10.1016/j.tcs.2010.12.047 10.1007/978-3-642-36742-7_15 10.1007/3-540-58216-9_48 10.1007/978-3-642-84524-6_2 10.1145/41840.41852 10.1007/BFb0014005 10.1007/BFb0025774 10.1109/SFCS.1977.32 10.1007/3-540-52559-9_62 10.1007/3-540-15670-4_6 10.1109/ICSE.2013.6606751
ContentType	Journal Article
Copyright	British Computer Society 2014 British Computer Society 2015
Copyright_xml	– notice: British Computer Society 2014 – notice: British Computer Society 2015
DBID	AAYXX CITATION 3V. 7SC 7XB 8AL 8AO 8FD 8FE 8FG 8FK ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- L7M L~C L~D M0N P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS Q9U
DOI	10.1007/s00165-014-0303-1
DatabaseName	CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ProQuest Central (purchase pre-March 2016) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest SciTech Premium Collection Technology Collection Advanced Technologies & Aerospace Collection ProQuest Central Essentials - QC ProQuest Central Database Suite (ProQuest) ProQuest Technology Collection ProQuest One ProQuest Central Korea ProQuest Central Student SciTech Collection (ProQuest) ProQuest Computer Science Collection Computer Science Database (ProQuest) Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection Proquest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China ProQuest Central Basic
DatabaseTitle	CrossRef Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Pharma Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace Advanced Technologies & Aerospace Collection ProQuest Computing ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition ProQuest One Academic ProQuest Central (Alumni) ProQuest One Academic (New)
DatabaseTitleList	CrossRef Computer and Information Systems Abstracts Computer Science Database
Database_xml	– sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1433-299X
EndPage	131
ExternalDocumentID	3541377561 10_1007_s00165_014_0303_1
Genre	Feature
GroupedDBID	-4Z -59 -5G -BR -EM -Y2 -~C .4S .86 .DC .VR 06D 0VY 1N0 1SB 203 28- 29H 2J2 2JY 2KG 2LR 2P1 2VQ 2~H 30V 3V. 4.4 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 8AO 8FE 8FG 8FW 8TC 95- 95. 95~ 96X AAAVM AABHQ AAHNG AAIAL AAJKR AAKMM AALFJ AAOBN AARHV AARTL AATVU AAWCG AAYIU AAYQN AAYTO AAYZH ABBBX ABBXA ABDPE ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABLJU ABMNI ABMOR ABMQK ABNWP ABQBU ABQSL ABSXP ABTAH ABTEG ABTHY ABTMW ABUWG ABXPI ACBXY ACGFS ACHXU ACIHN ACKNC ACM ACMLO ACOKC ACOMO ACREN ACSNA ACZOJ ADBSK ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADPZR ADRFC ADURQ ADYFF ADYOE ADZKW AEAQA AEBTG AEFIE AEGAL AEGNC AEJHL AEJRE AEKMD AENEX AEOHA AEPYU AETLH AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFWXC AFYQB AFZKB AGAYW AGDGC AGGDS AGJBK AGQMX AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMTXH AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN AZQEC B-. BA0 BBWZM BDATZ BENPR BGLVJ BGNMA BPHCQ CAG CCPQU COF CS3 CSCUP DL5 DNIVK DU5 DWQXO EBS EDO EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GUFHI GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I-F I09 IHE IJ- ITM IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX K6V K7- KDC KOV KOW LAS LHSKQ M0N M4Y MA- N2Q N9A NB0 NDZJH NQJWS NU0 O9- O93 O9G O9I O9J OAM OK1 P19 P62 P9O PF0 PQQKQ PROAC PT5 Q2X QOK QOS R4E R89 R9I RHV RIG RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7X Z81 Z83 Z88 Z8R Z8U Z8W Z92 ZMTXR ZY4 ~EX AAYXX ABFSG ACSTC ADHKG AEJOY AEZWR AFFHD AFHIU AGQPQ AHWEU AIXLP AKRVB CITATION EBLON PHGZM PHGZT PQGLB 7SC 7XB 8AL 8FD 8FK JQ2 L7M L~C L~D PKEHL PQEST PQUKI PRINS PUEGO Q9U
ID	FETCH-LOGICAL-c425t-47608332b8381fc6d13b9bf5e69a7d4dab5dd1ae4b01f3fbdda87f79fd8b2bcb3
IEDL.DBID	BENPR
ISICitedReferencesCount	7
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000347157300005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0934-5043
IngestDate	Sun Nov 09 09:20:59 EST 2025 Sat Aug 23 13:38:18 EDT 2025 Tue Nov 18 20:52:10 EST 2025 Sat Nov 29 01:39:32 EST 2025 Fri Feb 21 02:31:44 EST 2025
IsDoiOpenAccess	false
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	MSVL Temporal logic programming Distributed systems Theorem proving Temporal logic
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c425t-47608332b8381fc6d13b9bf5e69a7d4dab5dd1ae4b01f3fbdda87f79fd8b2bcb3
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23
OpenAccessLink	https://dl.acm.org/doi/pdf/10.1007/s00165-014-0303-1
PQID	1641175353
PQPubID	43690
PageCount	29
ParticipantIDs	proquest_miscellaneous_1660081983 proquest_journals_1641175353 crossref_primary_10_1007_s00165_014_0303_1 crossref_citationtrail_10_1007_s00165_014_0303_1 springer_journals_10_1007_s00165_014_0303_1
PublicationCentury	2000
PublicationDate	2015-01-01
PublicationDateYYYYMMDD	2015-01-01
PublicationDate_xml	– month: 01 year: 2015 text: 2015-01-01 day: 01
PublicationDecade	2010
PublicationPlace	London
PublicationPlace_xml	– name: London
PublicationSubtitle	Applicable Formal Methods
PublicationTitle	Formal aspects of computing
PublicationTitleAbbrev	Form Asp Comp
PublicationYear	2015
Publisher	Springer London Association for Computing Machinery
Publisher_xml	– name: Springer London – name: Association for Computing Machinery
References	Manna, Pnueli (CR25) 1992 Peterson (CR27) 1977; 9 Yang, Duan, Ma (CR34) 2010; 20 CR19 CR18 CR15 Déharbe (CR9) 2013; 78 CR13 CR12 Hennessy (CR16) 2007 CR11 CR33 CR10 Hoare (CR17) 1978; 21 CR32 CR31 Bledsoe, Loveland (CR3) 1984 Bruns (CR4) 1996 Lamport (CR20) 1994; 16 CR2 CR6 Chen, Yeh (CR8) 1983; 9 CR5 CR7 CR28 CR26 CR24 Armbrust, Fox, Griffith, Joseph, Katz, Konwinski, Lee, Patterson, Rabkin, Stoica, Zaharia (CR1) 2010; 53 CR23 CR22 CR21 Ricart, Agrawala (CR29) 1981; 24 Duan (CR14) 2006 Rodriguez-Navas, Proenza (CR30) 2013; 39 e_1_2_1_2_17_2 e_1_2_1_2_16_2 e_1_2_1_2_19_2 e_1_2_1_2_32_2 e_1_2_1_2_33_2 e_1_2_1_2_11_2 e_1_2_1_2_30_2 Chen B-S (e_1_2_1_2_8_2) 1983; 9 e_1_2_1_2_10_2 e_1_2_1_2_31_2 e_1_2_1_2_13_2 e_1_2_1_2_12_2 e_1_2_1_2_15_2 e_1_2_1_2_34_2 Bruns G (e_1_2_1_2_4_2) 1996 e_1_2_1_2_29_2 e_1_2_1_2_27_2 e_1_2_1_2_28_2 e_1_2_1_2_21_2 e_1_2_1_2_22_2 e_1_2_1_2_20_2 e_1_2_1_2_25_2 e_1_2_1_2_26_2 e_1_2_1_2_23_2 e_1_2_1_2_24_2 e_1_2_1_2_9_2 Duan Z (e_1_2_1_2_14_2) 2006 cr-split#-e_1_2_1_2_18_2.1 e_1_2_1_2_5_2 Bledsoe W (e_1_2_1_2_3_2) 1984 e_1_2_1_2_6_2 cr-split#-e_1_2_1_2_18_2.2 e_1_2_1_2_7_2 e_1_2_1_2_1_2 e_1_2_1_2_2_2
References_xml	– volume: 9 start-page: 710 issue: 6 year: 1983 end-page: 722 ident: CR8 article-title: Formal specification and verification of distributed systems publication-title: Trans Soft Eng SE- doi: 10.1109/TSE.1983.235434 – volume: 78 start-page: 310 issue: 3 year: 2013 end-page: 326 ident: CR9 article-title: Integration of SMT-solvers in B and Event-B development environment publication-title: Sci Comput Progr doi: 10.1016/j.scico.2011.03.007 – ident: CR22 – ident: CR18 – volume: 16 start-page: 872 issue: 3 year: 1994 end-page: 923 ident: CR20 article-title: The temporal logic of actions publication-title: ACM Trans Program Lang Syst doi: 10.1145/177492.177726 – year: 1984 ident: CR3 publication-title: Automating theorem proving: after 25 years doi: 10.1090/conm/029 – volume: 9 start-page: 223 issue: 3 year: 1977 end-page: 252 ident: CR27 article-title: Petri nets publication-title: ACM Comput Surv doi: 10.1145/356698.356702 – ident: CR2 – ident: CR12 – ident: CR10 – year: 2007 ident: CR16 publication-title: A distributed Pi-calculus doi: 10.1017/CBO9780511611063 – ident: CR33 – year: 2006 ident: CR14 publication-title: Temporal logic and temporal logic programming language – ident: CR6 – volume: 20 start-page: 865 issue: 5 year: 2010 end-page: 914 ident: CR34 article-title: Axiomatic semantics of projection temporal logic programs publication-title: Math Struct Comput Sci doi: 10.1017/S0960129510000241 – volume: 53 start-page: 50 issue: 4 year: 2010 end-page: 58 ident: CR1 article-title: A view of cloud computing publication-title: Commun ACM doi: 10.1145/1721654.1721672 – ident: CR23 – year: 1996 ident: CR4 publication-title: Distributed systems analysis with CCS – ident: CR21 – ident: CR19 – volume: 24 start-page: 9 issue: 1 year: 1981 end-page: 17 ident: CR29 article-title: An optimal algorithm for mutual exclusion in computer networks publication-title: Commun ACM doi: 10.1145/358527.358537 – volume: 21 start-page: 666 year: 1978 end-page: 677 ident: CR17 article-title: Communicating sequential processes publication-title: Commun ACM doi: 10.1145/359576.359585 – year: 1992 ident: CR25 publication-title: Temporal logic of reactive and concurrent systems doi: 10.1007/978-1-4612-0931-7 – ident: CR15 – ident: CR31 – ident: CR13 – ident: CR11 – ident: CR32 – ident: CR5 – ident: CR7 – ident: CR28 – ident: CR26 – ident: CR24 – volume: 39 start-page: 857 issue: 6 year: 2013 end-page: 868 ident: CR30 article-title: Using timed automata for modeling distributed systems with clocks: challenges and solutions publication-title: IEEE Trans Softw Eng doi: 10.1109/TSE.2012.73 – ident: e_1_2_1_2_26_2 doi: 10.1007/978-3-642-24559-6_8 – ident: e_1_2_1_2_34_2 doi: 10.1017/S0960129510000241 – ident: e_1_2_1_2_9_2 doi: 10.1016/j.scico.2011.03.007 – ident: e_1_2_1_2_1_2 doi: 10.1145/1721654.1721672 – ident: e_1_2_1_2_25_2 doi: 10.5555/128869 – ident: e_1_2_1_2_27_2 doi: 10.1145/356698.356702 – ident: e_1_2_1_2_16_2 doi: 10.5555/1199324 – volume-title: Automating theorem proving: after 25 years year: 1984 ident: e_1_2_1_2_3_2 doi: 10.1090/conm/029 – ident: e_1_2_1_2_33_2 doi: 10.1145/1592434.1592436 – ident: #cr-split#-e_1_2_1_2_18_2.2 – volume: 9 start-page: 710 issue: 6 year: 1983 ident: e_1_2_1_2_8_2 article-title: Formal specification and verification of distributed systems publication-title: Trans Soft Eng SE- doi: 10.1109/TSE.1983.235434 – ident: e_1_2_1_2_12_2 doi: 10.1007/978-3-540-88194-0_12 – ident: e_1_2_1_2_22_2 – ident: e_1_2_1_2_32_2 doi: 10.1016/j.tcs.2010.12.047 – ident: e_1_2_1_2_6_2 doi: 10.1007/978-3-642-36742-7_15 – ident: e_1_2_1_2_20_2 doi: 10.1145/177492.177726 – ident: e_1_2_1_2_10_2 doi: 10.1007/3-540-58216-9_48 – volume-title: Distributed systems analysis with CCS year: 1996 ident: e_1_2_1_2_4_2 – ident: e_1_2_1_2_7_2 – ident: e_1_2_1_2_30_2 doi: 10.1109/TSE.2012.73 – ident: #cr-split#-e_1_2_1_2_18_2.1 doi: 10.1007/978-3-642-84524-6_2 – ident: e_1_2_1_2_21_2 doi: 10.1145/41840.41852 – ident: e_1_2_1_2_15_2 doi: 10.1007/BFb0014005 – ident: e_1_2_1_2_23_2 – ident: e_1_2_1_2_31_2 – ident: e_1_2_1_2_5_2 doi: 10.1007/BFb0025774 – ident: e_1_2_1_2_17_2 doi: 10.1145/359576.359585 – ident: e_1_2_1_2_28_2 doi: 10.1109/SFCS.1977.32 – volume-title: Temporal logic and temporal logic programming language year: 2006 ident: e_1_2_1_2_14_2 – ident: e_1_2_1_2_13_2 – ident: e_1_2_1_2_29_2 doi: 10.1145/358527.358537 – ident: e_1_2_1_2_2_2 doi: 10.1007/3-540-52559-9_62 – ident: e_1_2_1_2_24_2 doi: 10.1007/3-540-15670-4_6 – ident: e_1_2_1_2_11_2 doi: 10.1109/ICSE.2013.6606751 – ident: e_1_2_1_2_19_2
SSID	ssj0015911
Score	2.0445373
Snippet	Since distributed systems are inherently concurrent and asynchronous, it is a challenge for us to verify distributed systems. MSVL is a useful temporal logic...
SourceID	proquest crossref springer
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	103
SubjectTerms	Algorithms Axioms Communication systems Completeness Computation Computer networks Computer Science Math Applications in Computer Science Original Article Programming languages Temporal logic Theory of Computation
SummonAdditionalLinks	– databaseName: SpringerLINK Contemporary 1997-Present dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwEA8yffDF-YnTKRF8Ugrt0jTNo8iGDzqE6dhbab5gIK2sm_jne0nT-oEKSh9zScvlrvldLvkdQufSGEIZoxCbcAhQTB4GgjAWiNDowSCMLb-LKzbBxuN0NuP3_h531Zx2b1KS7k_dXnaz6MQeNIsDMEwSQMizTi3ZjA3RJ9M2dUC5K7oLkXocWHquJpX53RCfF6N3hPklKerWmlH3X1-5jbY8tMRXtS3soDVd7KJuU7YBey_eQ8MpWJ3xe3W4NFhZ8lxb90orXDM7V9juz2IAhzh_nZeO1tU32Q53k-ntPnocDR-ubwJfTSGQ4JfLIGYJwC0yECks0kYmKiKCC0N1wnOmYpULqlSU61iEkSFGKJWnzDBuVCoGQgpygDpFWehDhDmPiYbHALyJiTQQM3EuJEChnFNJaQ-FjVoz6anGbcWLp6wlSXZqykBNmVVTFvXQRdvluebZ-E2438xV5l2uyiDuc7SjlPTQWdsMzmIzIHmhy5WVSRwGSkHmspm_D0P89MKjP0kfo02AVbTeqOmjznKx0idoQ74s59Xi1FnrG2TO4lU priority: 102 providerName: Springer Nature
Title	Verification of distributed systems with the axiomatic system of MSVL
URI	https://link.springer.com/article/10.1007/s00165-014-0303-1 https://www.proquest.com/docview/1641175353 https://www.proquest.com/docview/1660081983
Volume	27
WOSCitedRecordID	wos000347157300005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1433-299X dateEnd: 20190131 omitProxy: false ssIdentifier: ssj0015911 issn: 0934-5043 databaseCode: P5Z dateStart: 20020501 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1433-299X dateEnd: 20190131 omitProxy: false ssIdentifier: ssj0015911 issn: 0934-5043 databaseCode: K7- dateStart: 20020501 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1433-299X dateEnd: 20190131 omitProxy: false ssIdentifier: ssj0015911 issn: 0934-5043 databaseCode: BENPR dateStart: 20020501 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1433-299X dateEnd: 20211231 omitProxy: false ssIdentifier: ssj0015911 issn: 0934-5043 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1La9wwEB7y6KGXvNrSbTaLCj2liNqWZVmnkIQNgSTLkrRL6MVYL1go680-Sn9-R1p50waSSzDoIskynhnpmxnxDcAX7RzjQnD0TSQ6KK5OqGJCUJU4m2VJ7vldQrEJMRiU9_dyGANu83itst0Tw0ZtGu1j5N8Q1gdWSc5Opg_UV43y2dVYQmMTtj1TGer59ll_MLxd5xG4DBV40W3PqefqavOaSaARTQt_cS2nqOiMpv-fTI9w80mGNBw8F7uv_eQ92ImQk5yudGQfNuzkAHbbcg4kWvc76I9QG12M4ZHGEeNJdX09LGvIivF5TnzcliBoJPWfcRPoXmOXn3BzN7p-Dz8u-t_PL2msskA12uuC5qJAGMYyVeLh7XRhUqakctwWshYmN7XixqS1zVWSOuaUMXUpnJDOlCpTWrEPsDVpJvYjEClzZvFxCHtyph36UlIqjRCpllxz3oGk_cOVjhTkvhLGr2pNnhyEUqFQKi-UKu3A8XrKdMW_8dLgbiuIKprivHqUQgc-r7vRiHxmpJ7YZunHFAEblTjmayvuf17x3IKfXl7wEN4ivuKriE0XthazpT2CN_r3Yjyf9aKu9mDzSlBsh_wntrd3o7_XgPFQ
linkProvider	ProQuest
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1bT9RAFD7BxUReQFHCAuqY4ItmYtuZ6XQejFFZAmHZEEXCW-3cEhKyBXYB_VP-Rs9M20VN4I0H08e5pT2X-eac6XcANo33TEgp8Gyi8IDiq4RqJiXViXdZlvDA7xKLTcjRqDg-Vgdz8Kv7FyZcq-x8YnTUtjYhRv4OYX1klRTsw9k5DVWjQna1K6HRqMWe-3mNR7bJ-90tlO_rLNseHH7eoW1VAWpQP6eUyxxhB8t0gZuVN7lNmVbaC5erSlpuKy2sTSvHdZJ65rW1VSG9VN4WOtNGM5z3AcxzxnPRg_lPg9HBl1neQqhY8TdRjNPADdblUZNIW5rm4aIcp2hYjKZ_74Q38PafjGzc6LaX_rdP9BgWW0hNPjY28ATm3HgZlrpyFaT1Xk9hcITW5tsYJak9sYE0ONT7cpY0jNYTEuLSBEExqX6c1JHOtm0KA_a_Hg2fwbd7eZkV6I3rsVsFohRnDh-PsI4z4_GsqJQ2CAErJYwQfUg6iZampVgPlT5Oyxk5dFSCEpWgDEpQpn14Mxty1vCL3NV5oxN82bqaSXkj9T68mjWjkwiZn2rs6svQJ4_Yr8A-bzv1-mOK2xZcu3vBl_Bo53B_WA53R3vrsIBYUjTRqQ3oTS8u3XN4aK6mJ5OLF62dEPh-33r3G00qTwg
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1ZSwMxEA6iIr5YT6xWjeCTsnS3SZrNo2iLYi3FaunbsrmgINvSQ_z5TvbyQAWRfcwkWSYz5JtM8g1CZ8pawjhnEJsICFBs7HuScO5J35pGw6eO3yUtNsG73XA4FL28zumsuO1epCSzNw2OpSmZ1yfa1suHbw6puEtn1AMjJR6EPysUAhl3p-uhPyjTCEykBXghaqeeo-oq0prfDfF5Y3pHm18SpOm-0678-4830UYOOfFlZiNbaMkk26hSlHPAuXfvoNYArNHmZ3h4bLF2pLquHpbROGN8nmF3bosBNOL4dTRO6V7zJtfhvj_o7KKnduvx6sbLqyx4Cvx17lHeBBhGGjKEzduqpg6IFNIy0xQx11THkmkdxIZKP7DESq3jkFsurA5lQypJ9tByMk7MPsJCUGLgswB7KFEWYikhpAKIFAumGKsiv1BxpHIKclcJ4zkqyZNTNUWgpsipKQqq6LzsMsn4N34TrhXrFuWuOIsgHkzpSBmpotOyGZzIZUbixIwXTqaZYqMQZC6KtfwwxE8THvxJ-gSt9a7bUee2e3eI1gF5sewsp4aW59OFOUKr6mU-mk2PUyN-AwkX7h0
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=Verification+of+distributed+systems+with+the+axiomatic+system+of+MSVL&rft.jtitle=Formal+aspects+of+computing&rft.au=Ma%2C+Qian&rft.au=Duan%2C+Zhenhua&rft.au=Zhang%2C+Nan&rft.au=Wang%2C+Xiaobing&rft.date=2015-01-01&rft.pub=Association+for+Computing+Machinery&rft.issn=0934-5043&rft.eissn=1433-299X&rft.volume=27&rft.issue=1&rft.spage=103&rft_id=info:doi/10.1007%2Fs00165-014-0303-1&rft.externalDocID=3541377561
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0934-5043&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0934-5043&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0934-5043&client=summon