5 problems
- 0 votes0 replies1 view
HHPB congruence conjecture for terms without auto-conflict
HHPB congruence conjecture. HHPB is equivalent to a congruence relation on terms that do not exhibit auto-conflict.
- 0 votes0 replies0 views
HHPB correspondence for barbed-congruent reversible processes
HHPB correspondence conjecture. If , then there exists a HHPB between and such that
- 0 votes0 replies1 view
Near-linear running time for parallel edge enumeration on graphs with few bisimulations
Running-time conjecture. The parallel edge enumeration algorithm may run in
- 0 votes0 replies0 views
Equivalence of higher-dimensional automata and history-dependent automata up to history-preserving bisimilarity
A higher-dimensional automaton (HDA) is a model for concurrency based on labeled precubical sets, while a history-dependent automaton is a formalism introduced by Montanari and Pis…
- 0 votes0 replies0 views
Conjecture that syntactic safety coincides with safety under bisimulations
Safety equivalence conjecture. These two definitions of safety—the syntactic notion and safety under bisimulations—coincide.