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
Theoretical Computer Science
Modeling concurrency with geometry
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of logic in computer science (vol. 4)
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Symbolic Verification of Communication Protocols with Infinite StateSpaces using QDDs
Formal Methods in System Design
ACM Computing Surveys (CSUR)
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Detecting Deadlocks in Concurrent Systems
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
On the Power of Labels in Transition Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Partial-Order Methods for Temporal Verification
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Proceedings of the 17th International Conference on Application and Theory of Petri Nets
Symmetry Reductions inModel Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
From Pre-historic to Post-modern Symbolic Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
A Stubborn Attack On State Explosion
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
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
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
Categories of asynchronous systems
Categories of asynchronous systems
On the classification of dipaths in geometric models for concurrency
Mathematical Structures in Computer Science
Homotopy invariants of higher dimensional categories and concurrency in computer science
Mathematical Structures in Computer Science
Sequencing tasks in multiprocess systems to avoid deadlocks
SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
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
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
Cubical local partial orders on cubically subdivided spaces: existence and construction
Theoretical Computer Science - Spatial representation: Discrete vs. continous computational models
Deadlocks and dihomotopy in mutual exclusion models
Theoretical Computer Science - Spatial representation: Discrete vs. continous computational models
The multilevel hypernetwork dynamics of complex systems of robot soccer agents
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Toward formal models of biologically inspired, highly parallel machine cognition
International Journal of Parallel, Emergent and Distributed Systems
Transactions on Computational Systems Biology IX
Undirected graphs of entanglement 2
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
| Hi-index | 0.00 |
Recent geometric methods have been used in concurrency theory for quickly finding deadlocks and unreachable states, see [14] for instance. The reason why these methods are fast is that they contain in germ ingredients for tackling the state-space explosion problem. In this paper we show how this can be made formal. We also give some hints about the underlying algorithmics. Finally, we compare with other well-known methods for coping with the state-space explosion problem.