Unifying Equivalences for Higher Dimensional Automata

Authors:
Elena Oshevskaya;Irina Virbitskaite;Eike Best
Affiliations:
Sobolev Institute of Mathematics, SB RAS, 4, Acad. Koptyug avenue, 630090, Novosibirsk, Russia;(Correspd.) (Also works: Novosibirsk State University, 2, Pirogova st., Novosibirsk, 630090, Russia) A.P. Ershov Institute of Informatics Systems, SB RAS, 6, Acad. Lavrentiev avenue, 630090, Novos ...;Carl von Ossietzky University of Oldenburg, D-26111 Oldenburg, Germany
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Year:
2012

Citing 19
Cited 0

Modeling concurrency with geometry

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A simple constructive computability theorem for wait-free computation

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Towards a unified view of bisimulation: a comparative study

Theoretical Computer Science
Universal coalgebra: a theory of systems

Theoretical Computer Science - Modern algebra and its applications
Coalgebra morphisms subsume open maps

Theoretical Computer Science
New Perspectives in Distributed Computing

MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Detecting Deadlocks in Concurrent Systems

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Homology of Higher Dimensional Automata

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Domains of Higher-Dimensional Automata

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Obseving Behaviour Categorically

Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Implementing a Static Analyzer of Concurrent Programs: Problems and Perspectives

Selected papers from the 5th LOMAPS Workshop on Analysis and Verification of Multiple-Agent Languages
A Final Coalgebra Theorem

Category Theory and Computer Science
Higher Dimensional Transition Systems

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Simulations in coalgebra

Theoretical Computer Science - Selected papers of CMCS'03
On the expressiveness of higher dimensional automata

Theoretical Computer Science - Expressiveness in concurrency
Causality versus true-concurrency

Theoretical Computer Science
A Coalgebraic Characterization of Behaviours in the Linear Time --- Branching Time Spectrum

Recent Trends in Algebraic Development Techniques
A Categorical View of Timed Behaviours

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
A category of higher-dimensional automata

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

The intention of the paper is to show how several categorical (open morphisms, path morphisms and coalgebraic morphisms based) approaches to an abstract characterization of bisimulation relate to each other and to behavioral bisimulations, in the setting of higher dimensional automata. Such a relating makes it possible to develop a metatheory designed for unified definition and study of equivalences in true concurrency semantics.