Matches in DBpedia 2016-04 for { ?s ?p "RP, the International Workshop on Reachability Problems is an annual academic conference in thefield of computer science.The Reachability Workshop is specifically aimed at gathering together scholars from diverse disciplines and backgrounds interested in reachability problems that appear in Algebraic structures Computational models Hybrid systems Logic and Formal verificationTopics of interest include (but are not limited to): Reachability problems in infinite state systems, rewriting systems, dynamical and hybrid systems; reachability problems in logic and verification; reachability analysis in different computational models, counter timed/ cellular/ communicating automata; Petri-Nets; computational aspects of algebraic structures (semigroups, groups and rings); frontiers between decidable and undecidable reachability problems; predictability in iterative maps and new computational paradigms."@en }
Showing triples 1 to 4 of
4
with 100 triples per page.
- Workshop_on_Reachability_Problems abstract "RP, the International Workshop on Reachability Problems is an annual academic conference in thefield of computer science.The Reachability Workshop is specifically aimed at gathering together scholars from diverse disciplines and backgrounds interested in reachability problems that appear in Algebraic structures Computational models Hybrid systems Logic and Formal verificationTopics of interest include (but are not limited to): Reachability problems in infinite state systems, rewriting systems, dynamical and hybrid systems; reachability problems in logic and verification; reachability analysis in different computational models, counter timed/ cellular/ communicating automata; Petri-Nets; computational aspects of algebraic structures (semigroups, groups and rings); frontiers between decidable and undecidable reachability problems; predictability in iterative maps and new computational paradigms.".
- Q17141558 abstract "RP, the International Workshop on Reachability Problems is an annual academic conference in thefield of computer science.The Reachability Workshop is specifically aimed at gathering together scholars from diverse disciplines and backgrounds interested in reachability problems that appear in Algebraic structures Computational models Hybrid systems Logic and Formal verificationTopics of interest include (but are not limited to): Reachability problems in infinite state systems, rewriting systems, dynamical and hybrid systems; reachability problems in logic and verification; reachability analysis in different computational models, counter timed/ cellular/ communicating automata; Petri-Nets; computational aspects of algebraic structures (semigroups, groups and rings); frontiers between decidable and undecidable reachability problems; predictability in iterative maps and new computational paradigms.".
- Workshop_on_Reachability_Problems comment "RP, the International Workshop on Reachability Problems is an annual academic conference in thefield of computer science.The Reachability Workshop is specifically aimed at gathering together scholars from diverse disciplines and backgrounds interested in reachability problems that appear in Algebraic structures Computational models Hybrid systems Logic and Formal verificationTopics of interest include (but are not limited to): Reachability problems in infinite state systems, rewriting systems, dynamical and hybrid systems; reachability problems in logic and verification; reachability analysis in different computational models, counter timed/ cellular/ communicating automata; Petri-Nets; computational aspects of algebraic structures (semigroups, groups and rings); frontiers between decidable and undecidable reachability problems; predictability in iterative maps and new computational paradigms.".
- Q17141558 comment "RP, the International Workshop on Reachability Problems is an annual academic conference in thefield of computer science.The Reachability Workshop is specifically aimed at gathering together scholars from diverse disciplines and backgrounds interested in reachability problems that appear in Algebraic structures Computational models Hybrid systems Logic and Formal verificationTopics of interest include (but are not limited to): Reachability problems in infinite state systems, rewriting systems, dynamical and hybrid systems; reachability problems in logic and verification; reachability analysis in different computational models, counter timed/ cellular/ communicating automata; Petri-Nets; computational aspects of algebraic structures (semigroups, groups and rings); frontiers between decidable and undecidable reachability problems; predictability in iterative maps and new computational paradigms.".