A simplified parallel ASM thesis

Klaus Dieter Schewe; Qing Wang

doi:10.1007/978-3-642-30885-7_27

A simplified parallel ASM thesis

Klaus Dieter Schewe^*, Qing Wang

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

8 Citations (Scopus)

Abstract

We present an idea how to simplify Gurevich's parallel ASM thesis. The key idea is to modify only the bounded exploration postulate from the sequential ASM thesis by allowing also non-ground comprehension terms. The idea arises from comparison with work on ASM foundations of database transformations.

Original language	English
Title of host publication	Abstract State Machines, Alloy, B, VDM, and Z - Third International Conference, ABZ 2012, Proceedings
Pages	341-344
Number of pages	4
DOIs	https://doi.org/10.1007/978-3-642-30885-7_27
Publication status	Published - 2012
Event	3rd International Conference on Abstract State Machines, Alloy, B, VDM, and Z, ABZ 2012 - Pisa, Italy Duration: 18 Jun 2012 → 21 Jun 2012

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7316 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	3rd International Conference on Abstract State Machines, Alloy, B, VDM, and Z, ABZ 2012
Country/Territory	Italy
City	Pisa
Period	18/06/12 → 21/06/12

Access to Document

10.1007/978-3-642-30885-7_27

Cite this

Schewe, K. D., & Wang, Q. (2012). A simplified parallel ASM thesis. In Abstract State Machines, Alloy, B, VDM, and Z - Third International Conference, ABZ 2012, Proceedings (pp. 341-344). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7316 LNCS). https://doi.org/10.1007/978-3-642-30885-7_27

@inproceedings{1f2017009ca84328bf660ad09f629fe2,

title = "A simplified parallel ASM thesis",

abstract = "We present an idea how to simplify Gurevich's parallel ASM thesis. The key idea is to modify only the bounded exploration postulate from the sequential ASM thesis by allowing also non-ground comprehension terms. The idea arises from comparison with work on ASM foundations of database transformations.",

keywords = "Abstract State Machine, bounded exploration, synchronous parallelism",

author = "Schewe, {Klaus Dieter} and Qing Wang",

year = "2012",

doi = "10.1007/978-3-642-30885-7_27",

language = "English",

isbn = "9783642308840",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "341--344",

booktitle = "Abstract State Machines, Alloy, B, VDM, and Z - Third International Conference, ABZ 2012, Proceedings",

note = "3rd International Conference on Abstract State Machines, Alloy, B, VDM, and Z, ABZ 2012 ; Conference date: 18-06-2012 Through 21-06-2012",

}

Schewe, KD & Wang, Q 2012, A simplified parallel ASM thesis. in Abstract State Machines, Alloy, B, VDM, and Z - Third International Conference, ABZ 2012, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7316 LNCS, pp. 341-344, 3rd International Conference on Abstract State Machines, Alloy, B, VDM, and Z, ABZ 2012, Pisa, Italy, 18/06/12. https://doi.org/10.1007/978-3-642-30885-7_27

A simplified parallel ASM thesis. / Schewe, Klaus Dieter; Wang, Qing.
Abstract State Machines, Alloy, B, VDM, and Z - Third International Conference, ABZ 2012, Proceedings. 2012. p. 341-344 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7316 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A simplified parallel ASM thesis

AU - Schewe, Klaus Dieter

AU - Wang, Qing

PY - 2012

Y1 - 2012

N2 - We present an idea how to simplify Gurevich's parallel ASM thesis. The key idea is to modify only the bounded exploration postulate from the sequential ASM thesis by allowing also non-ground comprehension terms. The idea arises from comparison with work on ASM foundations of database transformations.

AB - We present an idea how to simplify Gurevich's parallel ASM thesis. The key idea is to modify only the bounded exploration postulate from the sequential ASM thesis by allowing also non-ground comprehension terms. The idea arises from comparison with work on ASM foundations of database transformations.

KW - Abstract State Machine

KW - bounded exploration

KW - synchronous parallelism

UR - http://www.scopus.com/inward/record.url?scp=84863955925&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-30885-7_27

DO - 10.1007/978-3-642-30885-7_27

M3 - Conference contribution

SN - 9783642308840

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 341

EP - 344

BT - Abstract State Machines, Alloy, B, VDM, and Z - Third International Conference, ABZ 2012, Proceedings

T2 - 3rd International Conference on Abstract State Machines, Alloy, B, VDM, and Z, ABZ 2012

Y2 - 18 June 2012 through 21 June 2012

ER -

A simplified parallel ASM thesis

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this