RP 2015 - 9th International Workshop on Reachability Problems
Date2015-09-21 - 2015-09-23
Deadline2015-06-11
VenueWarsaw, Poland
Keywords
Websitehttps://rp2015.mimuw.edu.pl
Topics/Call fo Papers
The Department of Mathematics, Informatics and Mechanics will organize the 9th International Workshop on Reachability Problems (RP'2015). This event will take place in the heart of Warsaw.
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 renowned invited experts and survey emerging trends and emphasize on key open challenges. Participants are kindly encouraged to discuss 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 renowned invited experts and survey emerging trends and emphasize on key open challenges. Participants are kindly encouraged to discuss 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
- Object-Oriented Programming, Systems, Languages & Applications
- 6th Workshop on Automating Test case design, Selection and Evaluation
- International Workshop on Human-Oriented Formal Methods: From Readability to Automation
- 4th International Symposium on Modelling and Knowledge Management applications: Systems and Domains
- First International Workshop on the ART of Software Composition
Last modified: 2015-03-04 21:30:52