RP 2014 - The 8th International Workshop on Reachability Problems
Topics/Call fo Papers
The Department of Computer Science will organize the 8th International workshop on Reachability Problems (RP’2014) in Oxford, September 22nd-24th, 2014.
Papers presenting original contributions related to reachability problems in different computational models and systems are being sought.
This will also be the occasion to review recent breakthroughs by renown invited experts and survey emerging trends and emphasize on key open challenges. Participants are kindly encouraged to discuss on core scientific issues that need to be further tackled.
TOPICS
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 Verification
Topics 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.
Papers presenting original contributions related to reachability problems in different computational models and systems are being sought.
This will also be the occasion to review recent breakthroughs by renown invited experts and survey emerging trends and emphasize on key open challenges. Participants are kindly encouraged to discuss on core scientific issues that need to be further tackled.
TOPICS
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 Verification
Topics 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.
Other CFPs
- International Symposium on Emerging Inter-networks, Communication and Mobility (EICM)
- Special Issue on Visual Computing in the Cloud: Cloud Gaming and Virtualization
- Tokyo International Conference on Software Engineering and Digital Technology
- 11th International Congress on the Biology of Fish
- 22nd International Conference on Telecommunications (ICT 2015)
Last modified: 2014-04-27 22:23:59