
Reachability Problems (eBook, PDF)
12th International Conference, RP 2018, Marseille, France, September 24-26, 2018, Proceedings
Redaktion: Potapov, Igor; Reynier, Pierre-Alain
Versandkostenfrei!
Sofort per Download lieferbar
40,95 €
inkl. MwSt.
Weitere Ausgaben:
PAYBACK Punkte
20 °P sammeln!
This book constitutes the refereed proceedings of the 12th International Conference on Reachability Problems, RP 2018, held in Marseille, France, in September 2018. The 11 full papers presented were carefully reviewed and selected from 21 submissions. The papers cover topics such as reachability for infinite state systems; rewriting systems; reachability analysis in counter/timed/cellular/communicating automata; Petri nets; computational aspects of semigroups, groups, and rings; reachability in dynamical and hybrid systems; frontiers between decidable and undecidable reachability problems; com...
This book constitutes the refereed proceedings of the 12th International Conference on Reachability Problems, RP 2018, held in Marseille, France, in September 2018.
The 11 full papers presented were carefully reviewed and selected from 21 submissions. The papers cover topics such as reachability for infinite state systems; rewriting systems; reachability analysis in counter/timed/cellular/communicating automata; Petri nets; computational aspects of semigroups, groups, and rings; reachability in dynamical and hybrid systems; frontiers between decidable and undecidable reachability problems; complexity and decidability aspects; predictability in iterative maps, and new computational paradigms.
Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.
Alle Preise in Euro und inkl. der gesetzl. MwSt. | Innerhalb Deutschlands liefern wir preisgebundene Bücher versandkostenfrei. Weitere Informationen: bitte hier klicken
Support
Bitte wählen Sie Ihr Anliegen aus:
Rechnungen
Bestellstatus
Retourenschein
Storno