You do not have permission to delete messages in this group
Copy link
Report message
Sign in to report message
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to prismmod...@googlegroups.com
Hello,
I was reading the 'Model Checking for Probabilistic Timed Automata' paper (NPS13) and it talks about PRISM supporting verification via backward reachability methods.
But I couldn't figure out a way to use it. I tried searching the sourcecode, but couldn't find any leads. Is there a version of PRISM which allows one to use this method? Or is there any open-source implementation of the backwards reachability algorithm?
Thanks, Pranav
Dave Parker
unread,
Jun 1, 2015, 6:44:51 PM6/1/15
Reply to author
Sign in to reply to author
Forward
Sign in to forward
Delete
You do not have permission to delete messages in this group
Copy link
Report message
Sign in to report message
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to prismmod...@googlegroups.com, prana...@gmail.com
Hi Pranav,
I just checked - this is actually still in a separate branch and has not
been pushed into the main release. If you are interested in getting
access to the source, I can send you some details separately.