Samiksha Jaiswal (Editor)

Workshop on Reachability Problems

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit
Abbreviation
  
RP

Frequency
  
annual

History
  
2007–

Discipline
  
Automata theory, Algebraic structures, logic, verification, computational models

Publisher
  
Lecture Notes in Computer Science, Springer

RP, the International Workshop on Reachability Problems is an annual academic conference in the field 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 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.

    History of the Workshop

  • RP'15 in Warsaw, Poland, LNCS proceedings, Springer Verlag
  • RP'14 in Oxford, UK, LNCS proceedings, Springer Verlag
  • RP'13 in Uppsala, Sweden, LNCS proceedings, Springer Verlag
  • RP'12 in Bordeaux, France, LNCS proceedings, Volume 7550/2012, Springer Verlag
  • RP'11 in Genova, Italy, LNCS proceedings, Volume 6945/2011, Springer Verlag
  • RP'10 in Brno, Czech Republic, LNCS proceedings, Volume 6227/2010, Springer Verlag
  • RP'09 in Palaiseau, France, LNCS proceedings, Volume 5797/2009, Springer Verlag
  • RP'08 in Liverpool, UK, ENTCS proceedings, Volume 223, Elsevier
  • RP'07 in Turku, Finland, TUCS General Publication Serie, Volume 45, Turku Centre for Computer Science
  • References

    Workshop on Reachability Problems Wikipedia