Satisfiability of Linear Time Mu-Calculus on Finite Traces.


https://doi.org/10.1007/978-3-319-42634-1_49
@inproceedings{DBLP:conf/cocoon/LiuDTC16, author = {Yao Liu and Zhenhua Duan and Cong Tian and Bin Cui}, editor = {Thang N. Dinh and My T. Thai}, title = {Satisfiability of Linear Time Mu-Calculus on Finite Traces}, booktitle = {Computing and Combinatorics - 22nd International Conference, {COCOON} 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9797}, pages = {611--622}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-319-42634-1\_49}, doi = {10.1007/978-3-319-42634-1\_49}, timestamp = {Sun, 15 Dec 2019 18:57:43 +0100}, biburl = {https://dblp.org/rec/conf/cocoon/LiuDTC16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

本页面没有标签
本页面最近更新:2020/05/21更新历史
发现错误?想一起完善? 在 GitHub 上编辑此页!
本页面的全部内容在 CC BY-SA 4.0 SATA 协议之条款下提供,附加条款亦可能应用

Copyright © 2016 - 2020 PKU Scholar

最近更新: 52aade4, 2020-05-21