License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CALCO.2015.101
URN: urn:nbn:de:0030-drops-55295
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5529/
Fahrenberg, Uli ;
Legay, Axel
Partial Higher-dimensional Automata
Abstract
We propose a generalization of higher-dimensional automata, partial HDA. Unlike HDA, and also extending event structures and Petri nets, partial HDA can model phenomena such as priorities or the disabling of an event by another event. Using open maps and unfoldings, we introduce a natural notion of (higher-dimensional) bisimilarity for partial HDA and relate it to history-preserving bisimilarity and split bisimilarity. Higher-dimensional bisimilarity has a game characterization and is decidable in polynomial time.
BibTeX - Entry
@InProceedings{fahrenberg_et_al:LIPIcs:2015:5529,
author = {Uli Fahrenberg and Axel Legay},
title = {{Partial Higher-dimensional Automata}},
booktitle = {6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015)},
pages = {101--115},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-84-2},
ISSN = {1868-8969},
year = {2015},
volume = {35},
editor = {Lawrence S. Moss and Pawel Sobocinski},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5529},
URN = {urn:nbn:de:0030-drops-55295},
doi = {10.4230/LIPIcs.CALCO.2015.101},
annote = {Keywords: higher-dimensional automata, bisimulation}
}
Keywords: |
|
higher-dimensional automata, bisimulation |
Collection: |
|
6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015) |
Issue Date: |
|
2015 |
Date of publication: |
|
28.10.2015 |