Conference icon

Conference

Concurrent logic games on partial orders

Abstract:

Most games for analysing concurrent systems are played on interleaving models, such as graphs or infinite trees. However, several concurrent systems have partial order models rather than interleaving ones. As a consequence, a potentially algorithmically undesirable translation from a partial order setting to an interleaving one is required before analysing them with traditional techniques. In order to address this problem, this paper studies a game played directly on partial orders and descri...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted Manuscript

Actions


Access Document


Files:
Publisher copy:
10.1007/978-3-642-20920-8_17

Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
Publisher:
Springer Berlin Heidelberg Publisher's website
Volume:
6642
Pages:
146-160
Publication date:
2011
DOI:
ISSN:
1611-3349
URN:
uuid:8d5b5021-7e16-4c01-9aa9-231a48ac7c55
Source identifiers:
572661
Local pid:
pubs:572661
ISBN:
978-3-642-20920-8

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP