(2015) 6th Conference on Algebra and Coalgebra in Computer Science (June.2015)
Files
No attached file found for this publication.
Details
Authors
Fahrenberg, Uli
Author
Legay, AxelUCLouvain
Author
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.
Fahrenberg, U., & Legay, A. (2015). Partial Higher-Dimensional Automata. 6th Conference on Algebra and Coalgebra in Computer Science. https://hdl.handle.net/2078.5/227803