Deadlocks and dihomotopy in mutual exclusion models

Higher dimensional automata (HDA) represent a promising tool for modelling (“true”) concurrency in a both combinatorial and topological framework. Within these models, fast algorithms investigating deadlocks and unreachable regions have been devised previously on a background of easily understandabl...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 365; no. 3; pp. 247 - 257
Main Author RAUSSEN, Martin
Format Journal Article Conference Proceeding
LanguageEnglish
Published Amsterdam Elsevier B.V 12.11.2006
Elsevier
Subjects
Algebraic topology
Algorithmics. Computability. Computer arithmetics
Applied sciences
Automata. Abstract machines. Turing machines
Computer science; control theory; systems
Deadlock detection
Dihomotopy
Exact sciences and technology
Mathematics
Mutual exclusion
Sciences and techniques of general use
Theoretical computing
Topology. Manifolds and cell complexes. Global analysis and analysis on manifolds
Dihomotopy
Mutual exclusion
Deadlock detection
Deadlock
Homotopy theory
Automaton
Computer theory
Concurrency
Fast algorithm
Online AccessGet full text
ISSN0304-3975
1879-2294
DOI10.1016/j.tcs.2006.07.052

Cover

Abstract Higher dimensional automata (HDA) represent a promising tool for modelling (“true”) concurrency in a both combinatorial and topological framework. Within these models, fast algorithms investigating deadlocks and unreachable regions have been devised previously on a background of easily understandable “directed” geometric ideas. In this article, we modify notions and methods from homotopy theory to define and investigate “essentially different” schedules in a HDA and to detect whether two given runs are essentially different using an algorithm again based on “directed geometry”.
AbstractList Higher dimensional automata (HDA) represent a promising tool for modelling (“true”) concurrency in a both combinatorial and topological framework. Within these models, fast algorithms investigating deadlocks and unreachable regions have been devised previously on a background of easily understandable “directed” geometric ideas. In this article, we modify notions and methods from homotopy theory to define and investigate “essentially different” schedules in a HDA and to detect whether two given runs are essentially different using an algorithm again based on “directed geometry”.
Author Raußen, Martin
Author_xml – sequence: 1
  givenname: Martin
  surname: RAUSSEN
  fullname: RAUSSEN, Martin
  organization: Department of Mathematical Sciences, Aalborg University, Fredrik Bajers Vej 7G, 9220 Aalborg, Denmark
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18288797$$DView record in Pascal Francis
BookMark eNp9kE1LAzEQhoNUsK3-AG978bhrPjabXTxJ_YSCFz2HmEwwNd2UJBX7702pePDQuQwM7zPMPDM0GcMICF0S3BBMuutVk3VqKMZdg0WDOT1BU9KLoaZ0aCdoihluazYIfoZmKa1wKS66KWJ3oIwP-jNVajSVcR9hHXLY7Co3Vutt3ipfwbf22-RCGQQDPp2jU6t8govfPkdvD_evi6d6-fL4vLhd1ppRkWvWEWH61lAQjLS4N4BNp5XgVumBt8QMyr5zyrklhGtmTfljaEGAtsQqQtgcXR32blTSytuoRu2S3ES3VnEnSU_78qEoOXHI6RhSimCldlnlcnCOynlJsNw7kitZHMm9I4mFLI4KSf6Rf8uPMDcHppiALwdRJu1g1GBcBJ2lCe4I_QOcaoEO
CODEN TCSCDI
CitedBy_id crossref_primary_10_1007_s10818_010_9094_5
crossref_primary_10_1007_s10703_022_00393_9
crossref_primary_10_2140_agt_2010_10_1683
Cites_doi 10.4310/HHA.2003.v5.n2.a1
10.1017/S0960129500003145
10.4310/HHA.2003.v5.n2.a5
10.1016/S1571-0661(05)01147-3
10.1016/j.tcs.2006.03.022
10.1145/99583.99625
10.1016/j.aam.2005.02.003
10.1017/S0960129500003133
10.4310/HHA.2003.v5.n2.a9
10.1023/B:APCS.0000013812.75342.de
10.1145/9758.9759
10.1007/BFb0055632
ContentType Journal Article
Conference Proceeding
Copyright 2006 Elsevier B.V.
2007 INIST-CNRS
Copyright_xml – notice: 2006 Elsevier B.V.
– notice: 2007 INIST-CNRS
DBID 6I.
AAFTH
AAYXX
CITATION
IQODW
DOI 10.1016/j.tcs.2006.07.052
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
Pascal-Francis
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
Applied Sciences
EISSN 1879-2294
EndPage 257
ExternalDocumentID 18288797
10_1016_j_tcs_2006_07_052
S0304397506005020
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
123
1B1
1RT
1~.
1~5
29Q
4.4
457
4G.
5VS
6I.
7-5
71M
8P~
9JN
AABNK
AACTN
AAEDT
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABAOU
ABBOA
ABEFU
ABFNM
ABJNI
ABMAC
ABTAH
ABVKL
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADMUD
AEBSH
AEKER
AENEX
AEXQZ
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
G8K
GBLVA
GBOLZ
HVGLF
HZ~
IHE
IXB
J1W
KOM
LG9
M26
M41
MHUIS
MO0
N9A
NCXOZ
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SCC
SDF
SDG
SES
SEW
SPC
SPCBC
SSV
SSW
SSZ
T5K
TAE
TN5
WH7
WUQ
XJT
YNT
ZMT
ZY4
~G-
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
ADVLN
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
8W4
AALMO
ABFLS
ABPIF
ABPTK
ADALY
IPNFZ
IQODW
ID FETCH-LOGICAL-c327t-3617d84d2e731408de0d6ca75fac9541d9afb5255f115c3fd01694e7ecf1fa113
IEDL.DBID AIKHN
ISSN 0304-3975
IngestDate Fri Nov 25 13:54:48 EST 2022
Wed Oct 01 03:57:58 EDT 2025
Thu Apr 24 23:02:49 EDT 2025
Fri Feb 23 02:16:41 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 3
Keywords Dihomotopy
Mutual exclusion
Deadlock detection
Deadlock
Homotopy theory
Automaton
Computer theory
Concurrency
Fast algorithm
Language English
License http://www.elsevier.com/open-access/userlicense/1.0
https://www.elsevier.com/tdm/userlicense/1.0
https://www.elsevier.com/open-access/userlicense/1.0
CC BY 4.0
LinkModel DirectLink
MeetingName Spatial representation: Discrete vs. continuous computational models
MergedId FETCHMERGED-LOGICAL-c327t-3617d84d2e731408de0d6ca75fac9541d9afb5255f115c3fd01694e7ecf1fa113
OpenAccessLink https://www.sciencedirect.com/science/article/pii/S0304397506005020
PageCount 11
ParticipantIDs pascalfrancis_primary_18288797
crossref_citationtrail_10_1016_j_tcs_2006_07_052
crossref_primary_10_1016_j_tcs_2006_07_052
elsevier_sciencedirect_doi_10_1016_j_tcs_2006_07_052
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2006-11-12
PublicationDateYYYYMMDD 2006-11-12
PublicationDate_xml – month: 11
  year: 2006
  text: 2006-11-12
  day: 12
PublicationDecade 2000
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationTitle Theoretical computer science
PublicationYear 2006
Publisher Elsevier B.V
Elsevier
Publisher_xml – name: Elsevier B.V
– name: Elsevier
References Raussen (bib17) 2000; 10
Goubault (bib10) 2000; 10
Goubault (bib12) 2003; 5
Carson, Reynolds (bib1) 1987; 9
Dijkstra (bib2) 1968
Grandis (bib14) 2003; 44
.
É. Goubault, The geometry of concurrency, Ph.D. Thesis, Ecole Normale Superieure, Paris, 1995.
É. Goubault, M. Raussen, Dihomotopy as a tool in state space analysis, in: S. Rajsbaum (Ed.), LATIN 2002: Theoretical Informatics, Cancun, Mexico, April 2002, Lecture Notes in Computer Science, Vol. 2286, Springer, Berlin, Proceedings, pp. 16–37.
Raussen (bib18) 2003; 5
L. Fajstrup, É. Goubault, M. Raussen, Detecting deadlocks in concurrent systems, in: D. Sangiorgi, R. de Simone (Eds.), CONCUR ’98; Concurrency Theory (Nice, France), Lecture Notes in Computer Science, Vol. 1466, Springer, Berlin, September 1998, Ninth Internat. Conf., Proceedings, pp. 332–347.
Fajstrup (bib3) 2003; 5
É. Goubault, Géométrie du Parallelisme, Analyse Statique et Autres Applications, Mémoire d’ habilitation à diriger les recherches, DEIN/SLA, CEA/Saclay, F-91191 Gif-sur-Yvette, France, 2001.
Fajstrup (bib4) 2005; 35
V. Pratt, Modelling concurrency with geometry, Proc. 18th ACM Symp. on Principles of Programming Languages, 1991, pp. 311–322.
Fajstrup, Goubault, Haucourt, Raussen (bib5) 2004; 12
L. Fajstrup, S. Sokołowski, Infinitely running concurrent processes with loops from a geometric viewpoint, Electronic Notes Theoretical Computer Science, Vol. 39, Springer, Berlin, no. 2, 2000, 19pp., URL
L. Fajstrup, É. Goubault, M. Raussen, Algebraic topology and concurrency, Theoret. Comput. Sci. 357 (2006) 241–278.
Gunawardena (bib15) 1994; 54
Fajstrup (10.1016/j.tcs.2006.07.052_bib3) 2003; 5
10.1016/j.tcs.2006.07.052_bib16
Carson (10.1016/j.tcs.2006.07.052_bib1) 1987; 9
10.1016/j.tcs.2006.07.052_bib13
Goubault (10.1016/j.tcs.2006.07.052_bib10) 2000; 10
10.1016/j.tcs.2006.07.052_bib11
Dijkstra (10.1016/j.tcs.2006.07.052_bib2) 1968
Fajstrup (10.1016/j.tcs.2006.07.052_bib5) 2004; 12
Goubault (10.1016/j.tcs.2006.07.052_bib12) 2003; 5
Gunawardena (10.1016/j.tcs.2006.07.052_bib15) 1994; 54
10.1016/j.tcs.2006.07.052_bib6
10.1016/j.tcs.2006.07.052_bib7
10.1016/j.tcs.2006.07.052_bib8
10.1016/j.tcs.2006.07.052_bib9
Grandis (10.1016/j.tcs.2006.07.052_bib14) 2003; 44
Raussen (10.1016/j.tcs.2006.07.052_bib17) 2000; 10
Fajstrup (10.1016/j.tcs.2006.07.052_bib4) 2005; 35
Raussen (10.1016/j.tcs.2006.07.052_bib18) 2003; 5
References_xml – volume: 10
  start-page: 411
  year: 2000
  end-page: 425
  ident: bib10
  article-title: Geometry and concurrency: a user's guide
  publication-title: Math. Structures Comput. Sci.
– volume: 5
  start-page: 95
  year: 2003
  end-page: 136
  ident: bib12
  article-title: Some geometric perspectives in concurrency theory
  publication-title: Homology, Homotopy, Appl.
– reference: L. Fajstrup, É. Goubault, M. Raussen, Detecting deadlocks in concurrent systems, in: D. Sangiorgi, R. de Simone (Eds.), CONCUR ’98; Concurrency Theory (Nice, France), Lecture Notes in Computer Science, Vol. 1466, Springer, Berlin, September 1998, Ninth Internat. Conf., Proceedings, pp. 332–347.
– volume: 10
  start-page: 427
  year: 2000
  end-page: 457
  ident: bib17
  article-title: On the classification of dipaths in geometric models for concurrency
  publication-title: Math. Struct. Comput. Sci.
– reference: É. Goubault, The geometry of concurrency, Ph.D. Thesis, Ecole Normale Superieure, Paris, 1995.
– reference: É. Goubault, Géométrie du Parallelisme, Analyse Statique et Autres Applications, Mémoire d’ habilitation à diriger les recherches, DEIN/SLA, CEA/Saclay, F-91191 Gif-sur-Yvette, France, 2001.
– reference: É. Goubault, M. Raussen, Dihomotopy as a tool in state space analysis, in: S. Rajsbaum (Ed.), LATIN 2002: Theoretical Informatics, Cancun, Mexico, April 2002, Lecture Notes in Computer Science, Vol. 2286, Springer, Berlin, Proceedings, pp. 16–37.
– volume: 44
  start-page: 281
  year: 2003
  end-page: 316
  ident: bib14
  article-title: Directed directed homotopy theory I. The fundamental category
  publication-title: Cahiers Topologie Géom. Différentielle Catégoriques
– start-page: 43
  year: 1968
  end-page: 110
  ident: bib2
  article-title: Co-operating sequential processes
  publication-title: Programming Languages
– volume: 5
  start-page: 1
  year: 2003
  end-page: 17
  ident: bib3
  article-title: Discovering spaces
  publication-title: Homology, Homotopy, Appl.
– reference: L. Fajstrup, É. Goubault, M. Raussen, Algebraic topology and concurrency, Theoret. Comput. Sci. 357 (2006) 241–278.
– volume: 35
  start-page: 188
  year: 2005
  end-page: 206
  ident: bib4
  article-title: Dipaths and dihomotopies in a cubical complex
  publication-title: Adv. in Appl. Math.
– volume: 12
  start-page: 81
  year: 2004
  end-page: 108
  ident: bib5
  article-title: Components of the fundamental category
  publication-title: Appl. Categ. Structures
– reference: L. Fajstrup, S. Sokołowski, Infinitely running concurrent processes with loops from a geometric viewpoint, Electronic Notes Theoretical Computer Science, Vol. 39, Springer, Berlin, no. 2, 2000, 19pp., URL:
– volume: 9
  start-page: 25
  year: 1987
  end-page: 53
  ident: bib1
  article-title: The geometry of semaphore programs
  publication-title: ACM TOPLAS
– volume: 54
  start-page: 184
  year: 1994
  end-page: 193
  ident: bib15
  article-title: Homotopy and concurrency
  publication-title: Bull. EATCS
– reference: .
– reference: V. Pratt, Modelling concurrency with geometry, Proc. 18th ACM Symp. on Principles of Programming Languages, 1991, pp. 311–322.
– volume: 5
  start-page: 257
  year: 2003
  end-page: 280
  ident: bib18
  article-title: State spaces and dipaths up to dihomotopy
  publication-title: Homology, Homotopy, Appl.
– ident: 10.1016/j.tcs.2006.07.052_bib11
– volume: 44
  start-page: 281
  year: 2003
  ident: 10.1016/j.tcs.2006.07.052_bib14
  article-title: Directed directed homotopy theory I. The fundamental category
  publication-title: Cahiers Topologie Géom. Différentielle Catégoriques
– volume: 5
  start-page: 1
  issue: 2
  year: 2003
  ident: 10.1016/j.tcs.2006.07.052_bib3
  article-title: Discovering spaces
  publication-title: Homology, Homotopy, Appl.
  doi: 10.4310/HHA.2003.v5.n2.a1
– volume: 10
  start-page: 427
  issue: 4
  year: 2000
  ident: 10.1016/j.tcs.2006.07.052_bib17
  article-title: On the classification of dipaths in geometric models for concurrency
  publication-title: Math. Struct. Comput. Sci.
  doi: 10.1017/S0960129500003145
– volume: 5
  start-page: 95
  issue: 2
  year: 2003
  ident: 10.1016/j.tcs.2006.07.052_bib12
  article-title: Some geometric perspectives in concurrency theory
  publication-title: Homology, Homotopy, Appl.
  doi: 10.4310/HHA.2003.v5.n2.a5
– ident: 10.1016/j.tcs.2006.07.052_bib13
– ident: 10.1016/j.tcs.2006.07.052_bib8
  doi: 10.1016/S1571-0661(05)01147-3
– ident: 10.1016/j.tcs.2006.07.052_bib9
– ident: 10.1016/j.tcs.2006.07.052_bib7
  doi: 10.1016/j.tcs.2006.03.022
– ident: 10.1016/j.tcs.2006.07.052_bib16
  doi: 10.1145/99583.99625
– volume: 35
  start-page: 188
  year: 2005
  ident: 10.1016/j.tcs.2006.07.052_bib4
  article-title: Dipaths and dihomotopies in a cubical complex
  publication-title: Adv. in Appl. Math.
  doi: 10.1016/j.aam.2005.02.003
– volume: 54
  start-page: 184
  year: 1994
  ident: 10.1016/j.tcs.2006.07.052_bib15
  article-title: Homotopy and concurrency
  publication-title: Bull. EATCS
– volume: 10
  start-page: 411
  issue: 4
  year: 2000
  ident: 10.1016/j.tcs.2006.07.052_bib10
  article-title: Geometry and concurrency: a user's guide
  publication-title: Math. Structures Comput. Sci.
  doi: 10.1017/S0960129500003133
– volume: 5
  start-page: 257
  issue: 2
  year: 2003
  ident: 10.1016/j.tcs.2006.07.052_bib18
  article-title: State spaces and dipaths up to dihomotopy
  publication-title: Homology, Homotopy, Appl.
  doi: 10.4310/HHA.2003.v5.n2.a9
– start-page: 43
  year: 1968
  ident: 10.1016/j.tcs.2006.07.052_bib2
  article-title: Co-operating sequential processes
– volume: 12
  start-page: 81
  issue: 1
  year: 2004
  ident: 10.1016/j.tcs.2006.07.052_bib5
  article-title: Components of the fundamental category
  publication-title: Appl. Categ. Structures
  doi: 10.1023/B:APCS.0000013812.75342.de
– volume: 9
  start-page: 25
  issue: 1
  year: 1987
  ident: 10.1016/j.tcs.2006.07.052_bib1
  article-title: The geometry of semaphore programs
  publication-title: ACM TOPLAS
  doi: 10.1145/9758.9759
– ident: 10.1016/j.tcs.2006.07.052_bib6
  doi: 10.1007/BFb0055632
SSID ssj0000576
Score 1.8087685
Snippet Higher dimensional automata (HDA) represent a promising tool for modelling (“true”) concurrency in a both combinatorial and topological framework. Within these...
SourceID pascalfrancis
crossref
elsevier
SourceType Index Database
Enrichment Source
Publisher
StartPage 247
SubjectTerms Algebraic topology
Algorithmics. Computability. Computer arithmetics
Applied sciences
Automata. Abstract machines. Turing machines
Computer science; control theory; systems
Deadlock detection
Dihomotopy
Exact sciences and technology
Mathematics
Mutual exclusion
Sciences and techniques of general use
Theoretical computing
Topology. Manifolds and cell complexes. Global analysis and analysis on manifolds
Title Deadlocks and dihomotopy in mutual exclusion models
URI https://dx.doi.org/10.1016/j.tcs.2006.07.052
Volume 365
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier ScienceDirect
  customDbUrl:
  eissn: 1879-2294
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000576
  issn: 0304-3975
  databaseCode: .~1
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals
  customDbUrl:
  eissn: 1879-2294
  dateEnd: 20211012
  omitProxy: true
  ssIdentifier: ssj0000576
  issn: 0304-3975
  databaseCode: AIKHN
  dateStart: 19950109
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: ScienceDirect (Elsevier)
  customDbUrl:
  eissn: 1879-2294
  dateEnd: 20211012
  omitProxy: true
  ssIdentifier: ssj0000576
  issn: 0304-3975
  databaseCode: ACRLP
  dateStart: 19950109
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: ScienceDirect Free and Delayed Access Journal
  customDbUrl:
  eissn: 1879-2294
  dateEnd: 20211102
  omitProxy: true
  ssIdentifier: ssj0000576
  issn: 0304-3975
  databaseCode: IXB
  dateStart: 19750601
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVLSH
  databaseName: Elsevier Journals
  customDbUrl:
  mediaType: online
  eissn: 1879-2294
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000576
  issn: 0304-3975
  databaseCode: AKRWK
  dateStart: 19750601
  isFulltext: true
  providerName: Library Specific Holdings
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwED5BWUCIN-JZeWBCCo1jO07HUkAFBAsgdYtc2xGFEirSSrDw2zknDo8BBsZEuSQ62_fd-c7fARwopo01SgSGMh1wxIBAxTYJREgt09yaQUnXdHUd9-74RV_0Z6Bbn4VxZZXe9lc2vbTW_k7La7M1Hg5bNy6ph2jqGPJCgV7PLMwh_iRJA-Y655e96y-DLGSVsnRJABSok5tlmddEFz4l4Sg8o9_gaXGsClRaVnW7-AZBZyuw5H1H0ql-bxVmbL4Gy3VfBuKX6RosXH1ysRbrwE5wGBGyHguickPM8N4V4D2P38gwJ09Td36E2Fc9mrp9M1J2xik24O7s9LbbC3yrhECzSE4Cho6ISbiJrGQYMiXGhibWSopM6bbg1LRVNhAYPmToAWqWGUfCwq20OqOZopRtQiN_zu0WECpshKOVSTR8HP03xam0CFrxgGFo02bbENYaSrXnEXftLEZpXTD2kKJSXX_LOA1likrdhsNPkXFFovHXw7xWe_pjJqRo5P8Sa_4Yoq8PYUyZyLbc-d97d2G-3HVxlX_RHjQmL1O7j37IZNCE2aN32vSzDa_O-8cf37rclQ
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwED6VMgBCvBHlUTwwIYUmsR23IypUBdouFIktcm1HFEpakVaChd_OOQ9KBxhYI9uJ7py773zn7wDOJFXaaMkd7VHlMPQBjgxM3eGuZ6hiRg9SuqZuL2g_sNtH_liCZnEXxpZV5rY_s-mptc6f1HJp1ibDYe3eJvXQm1qGPJcj6lmCZcZ9YSOwi895nQcCkixhaVMAOLxIbaZFXlOV5AkJS-Dp_-ac1icyQZFFWa-LHw6otQUbOXIkl9nHbUPJxDuwWXRlIPlPugNr3W8m1mQX6BUqER3WS0JkrIkePtnyu_Hkgwxj8jqzt0eIeVejmT01I2lfnGQPHlrX_WbbyRslOIr6YupQhCG6zrRvBMWAqa6NqwMlBY-kanDm6YaMBhyDhwjxn6KRthQszAijIi-Snkf3oRyPY3MAxOPGR11FAs0eQ_QmmScMuqxgQDGwadAKuIWEQpWziNtmFqOwKBd7DlGotrtlELoiRKFW4Px7yiSj0PhrMCvEHi7sgxBN_F_Tqgsqmr8II8q6aIjD_617CivtfrcTdm56d0ewmp6_2BpA_xjK07eZOUFEMh1U0x33BYWA3Fk
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=proceeding&rft.title=Theoretical+computer+science&rft.atitle=Deadlocks+and+dihomotopy+in+mutual+exclusion+models&rft.au=RAUSSEN%2C+Martin&rft.date=2006-11-12&rft.pub=Elsevier&rft.issn=0304-3975&rft.eissn=1879-2294&rft.volume=365&rft.issue=3&rft.spage=247&rft.epage=257&rft_id=info:doi/10.1016%2Fj.tcs.2006.07.052&rft.externalDBID=n%2Fa&rft.externalDocID=18288797
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon