Titlebook: Automata, Languages, and Programming; 39th International C Artur Czumaj,Kurt Mehlhorn,Roger Wattenhofer Conference proceedings 2012 Springe

安心地散步

https://doi.org/10.1007/978-3-8350-5487-5for Basic CCS and Basic Process Algebra, as a means for defining synchronization trees up to isomorphism as well as modulo bisimilarity and language equivalence. The expressiveness of algebraic recursion schemes is also compared to that of the low levels in the Caucal hierarchy.

最低点

,Thesenförmige Zusammenfassung, up to a given error . > 0 and computing a finite representation of an .-optimal strategy. We show that these problems are solvable in exponential time for a given configuration, and we also show that they are computationally hard in the sense that a polynomial-time approximation algorithm cannot exist unless P=NP.

Lipohypertrophy

Algebraic Synchronization Trees and Processesfor Basic CCS and Basic Process Algebra, as a means for defining synchronization trees up to isomorphism as well as modulo bisimilarity and language equivalence. The expressiveness of algebraic recursion schemes is also compared to that of the low levels in the Caucal hierarchy.

让步

Minimizing Expected Termination Time in One-Counter Markov Decision Processes up to a given error . > 0 and computing a finite representation of an .-optimal strategy. We show that these problems are solvable in exponential time for a given configuration, and we also show that they are computationally hard in the sense that a polynomial-time approximation algorithm cannot exist unless P=NP.