Schedulers as abstract interpretations of higher-dimensional automata
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Semantic analysis of shared-memory concurrent languages using abstract model-checking
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Lower Bounds in Distributed Computing
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Software Geography: Physical and Economic Aspects
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Data Structure as Topological Spaces
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Petri Nets, Configuration Structures and Higher Dimensional Automata
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Higher Dimensional Transition Systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Transition and cancellation in concurrency and branching time
Mathematical Structures in Computer Science
Investigation of concurrent processes by means of homotopy functors
Mathematical Structures in Computer Science
Geometry and concurrency: a user's guide
Mathematical Structures in Computer Science
Higher dimensional automata revisited
Mathematical Structures in Computer Science
On the semantics of place/transition Petri nets
Mathematical Structures in Computer Science
On the expressiveness of higher dimensional automata
Theoretical Computer Science - Expressiveness in concurrency
Algebraic topology and concurrency
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Erratum: Erratum to “On the expressiveness of higher dimensional automata”
Theoretical Computer Science
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Open maps bisimulations for higher dimensional automata models
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
Formal Relationships Between Geometrical and Classical Models for Concurrency
Electronic Notes in Theoretical Computer Science (ENTCS)
Unifying Equivalences for Higher Dimensional Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
History-Preserving Bisimilarity for Higher-Dimensional Automata via Open Maps
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |