Without further ado, here are some plans for my posts for the next two to three weeks:
- Some extensions of pushdown systems and how to do model checking on these structures. I covered the definitions of pushdown systems already in here, but not how to do model checking on these structures. So, I'll start there. Extensions that I will consider including prefix-recognizable systems, ground tree rewrite systems, and some probabilistic extensions.
- Well-structured transition systems. The theory of WSTS, which rely heavily on the theory of well-ordered quasi ordering, give general decidability results for reachability checking for large classes of infinite-state transition systems (eg, Petri Nets, lossy counter systems, etc).
25 comments:
interesting (and jargonic, hehehe -- that's from me, a frustrated student of logic, and a logician-to-be). hope these logic blogs will be a little more accessible (in explanation and cross-references, if not in language) to novice ones like me. ;-) tnx!
I'll try :)
thanks for the info master :)
thanks to sharing article master :)
thank you for the information
your posting thats i like :)
thanks to sharing article master :)
thank you for your sharing.it is very good.
thank you for sharing this information very useful :)
i like your blog, thanks to information :)
i like your article, thanks to sharing master :)
thanks to sharing master
thank you for sharing this information very useful :)
thanks to sharing article master :)
i like your blog, thanks to information :)
your posting thats i like :)
i like your article, thanks to sharing master :)
thanks to article master :)
thank you. awaited next article :)
your articles that I like :)
thanks to posting master
I really enjoyed every article written on this blog :)
may be useful for us all :)
thank you. awaited next article :)
I strongly agree with your article :)
Post a Comment