%0 Journal Article %1 journals/acta/Esparza97 %A Esparza, Javier %D 1997 %J Acta Inf. %K modelchecking petrinets timelogics %N 2 %P 85-107 %T Decidability of Model Checking for Infinite-State Concurrent Systems. %U http://www.informatik.uni-stuttgart.de/fmi/szs/publications/esparza/Acta.ps.gz %V 34 %X We study the decidability of the model checking problem for linear and branching time logics, and two models of concurrent computation, namely Petri nets and Basic Parallel Processes.

@article{journals/acta/Esparza97, abstract = {We study the decidability of the model checking problem for linear and branching time logics, and two models of concurrent computation, namely Petri nets and Basic Parallel Processes.}, added-at = {2020-01-16T10:48:56.000+0100}, author = {Esparza, Javier}, biburl = {https://www.bibsonomy.org/bibtex/2cc3674e55cd01ce463cbdec3f166c09b/paves_intern}, ee = {http://dx.doi.org/10.1007/s002360050074}, interhash = {c444ee955126d78fedc8e691c002cc59}, intrahash = {cc3674e55cd01ce463cbdec3f166c09b}, journal = {Acta Inf.}, keywords = {modelchecking petrinets timelogics}, number = 2, pages = {85-107}, timestamp = {2020-01-16T10:48:56.000+0100}, title = {Decidability of Model Checking for Infinite-State Concurrent Systems.}, url = {http://www.informatik.uni-stuttgart.de/fmi/szs/publications/esparza/Acta.ps.gz}, volume = 34, year = 1997 }