EXPSPACE-hardness of behavioural equivalences of succinct one-counter nets.
Petr JancarPetr OsickaZdenek SawaPublished in: CoRR (2018)
Keyphrases
- satisfiability problem
- phase transition
- np complete
- temporal logic
- connected components
- pspace complete
- relational algebra
- np hard
- collective decision making
- behavioural patterns
- information theoretic
- learning theory
- np hardness
- constraint satisfaction
- expressive power
- model checking
- worst case
- computational complexity