Searching for "Deciding Branching Time Logic" – sorted by Relevance.
-
On the model checking problem for branching time logics and Basic Parallel Processes
- -calculus is undecidable. The decidability of branching time logics like CTL [5], or CTL [7], which are some of the most
- Cited by 25 (1 self) – Add To MetaCart
-
Regular Trace Event Structures
- deal of the solutions to the decidability and model checking problems for branching time logics hinges
- Add To MetaCart

