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.
Original language | English |
---|---|
Pages (from-to) | 85-107 |
Number of pages | 23 |
Journal | Acta Informatica |
Volume | 34 |
Issue number | 2 |
DOIs | |
State | Published - 1997 |