Computational geometry: an introduction
Computational geometry: an introduction
The geometry of semaphore programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Theoretical Computer Science
Renaming in an asynchronous environment
Journal of the ACM (JACM)
Agreement is harder than consensus: set consensus problems in totally asynchronous systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Modeling concurrency with geometry
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the robustness of Herlihy's hierarchy
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Generalized FLP impossibility result for t-resilient asynchronous computations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Wait-free k-set agreement is impossible: the topology of public knowledge
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The asynchronous computability theorem for t-resilient tasks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A finiteness condition for rewriting systems
Theoretical Computer Science
A simple constructive computability theorem for wait-free computation
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Set consensus using arbitrary objects (preliminary version)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
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
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
The consensus hierarchy is not robust
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Journal of the ACM (JACM)
The serializability of concurrent database updates
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Distributed Algorithms
An optimal algorithm for testing for safety and detecting deadlocks in locked transaction systems
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
ECHIDNA: A System for Manipulating Explicit Choice Higher Dimensional Automata
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
Optimal Implementation of Wait-Free Binary Relations
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
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
Semantics and Analysis of Linda-Based Languages
WSA '93 Proceedings of the Third International Workshop on Static Analysis
A Stubborn Attack On State Explosion
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Extraction of Concurrent Processes from Higher Dimensional Automata
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
Relationships Between Models of Concurrency
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Relationships Between Models of Concurrency
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Higher Dimensional Word Problem
Proceedings of the 4th International Conference on Category Theory and Computer Science
Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Higher Dimensional Transition Systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Complete Cuboidal Sets in Axiomatic Domain Theory
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Categories of asynchronous systems
Categories of asynchronous systems
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
Computer modelling and natural phenomena
Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering
Transition and cancellation in concurrency and branching time
Mathematical Structures in Computer Science
A Manifesto for Agent Technology: Towards Next Generation Computing
Autonomous Agents and Multi-Agent Systems
A practical application of geometric semantics to static analysis of concurrent programs
CONCUR 2005 - Concurrency Theory
On the expressiveness of higher dimensional automata
Theoretical Computer Science - Expressiveness in concurrency
Asynchronous games 2: the true concurrency of innocence
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Scheduling for multi-threaded real-time programs via path planning
EMSOFT '06 Proceedings of the 6th ACM & IEEE International conference on Embedded software
Erratum: Erratum to “On the expressiveness of higher dimensional automata”
Theoretical Computer Science
Deadlocks and dihomotopy in mutual exclusion models
Theoretical Computer Science - Spatial representation: Discrete vs. continous computational models
Topological Properties of Event Structures
Electronic Notes in Theoretical Computer Science (ENTCS)
Asynchronous Games 3 An Innocent Model of Linear Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
Rigorous evidence of freedom from concurrency faults in industrial control software
SAFECOMP'11 Proceedings of the 30th international conference on Computer safety, reliability, and security
Computations in space and space in computations
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
Asynchronous games: innocence without alternation
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
History-Preserving Bisimilarity for Higher-Dimensional Automata via Open Maps
Electronic Notes in Theoretical Computer Science (ENTCS)
A Geometric View of Partial Order Reduction
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Geometrical methods in concurrency theory (and in distributed systems theory) have appeared recently for modelling and analyzing the behaviour of systems and also for solving computability and complexity issues. We identify some of the main directions of research, and survey some of the major ideas on which all this is based (some of which are now more than thirty years old).