Finite-state concurrent programs can be expressed in pairwise normal form

Simple item page
dc.contributor.authorAttie, Paul C.
dc.contributor.departmentDepartment of Computer Science
dc.contributor.facultyFaculty of Arts and Sciences (FAS)
dc.contributor.institutionAmerican University of Beirut
dc.date.accessioned2025-01-24T11:22:55Z
dc.date.available2025-01-24T11:22:55Z
dc.date.issued2016
dc.description.abstractWe show that any finite-state shared-memory concurrent program can be transformed into pairwise normal form: all variables are shared between exactly two processes, and the guards on transitions are conjunctions of conditions over this pairwise shared state. Specifically, if P is a finite-state shared-memory concurrent program, then there exists a finite-state shared-memory concurrent program P expressed in pairwise normal form such that P is strongly bisimilar to P. Our result is constructive: we give an algorithm for producing P, given P. (C) 2015 Elsevier B.V. All rights reserved.
dc.identifier.doihttps://doi.org/10.1016/j.tcs.2015.11.032
dc.identifier.eid2-s2.0-84957936177
dc.identifier.urihttp://hdl.handle.net/10938/25555
dc.language.isoen
dc.publisherElsevier
dc.relation.ispartofTheoretical Computer Science
dc.sourceScopus
dc.subjectFinite-state concurrent programs
dc.subjectExpressive completeness
dc.subjectAtomic registers
dc.subjectState-explosion
dc.titleFinite-state concurrent programs can be expressed in pairwise normal form
dc.typeArticle

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
2016-4865.pdf
Size:
1.45 MB
Format:
Adobe Portable Document Format
Download

Collections

Department of Computer Science