Maximal traces and path-based coalgebraic temporal logics

@article{Crstea2011MaximalTA,
  title={Maximal traces and path-based coalgebraic temporal logics},
  author={Corina C{\^i}rstea},
  journal={Theor. Comput. Sci.},
  year={2011},
  volume={412},
  pages={5025-5042}
}
This paper gives a general coalgebraic account of temporal logics whose semantics involves a notion of computation path. Examples of such logics include the logic CTL* for transition systems and the logic PCTL for probabilistic transition systems. Our path-based temporal logics are interpreted over coalgebras of endofunctors obtained as the composition of a computation type (e.g. nondeterministic or stochastic) with a general transition type. The semantics of such logics relies on the existence… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Traces

  • B. Jacobs, A. Sokolova
  • executions and schedulers, coalgebraically, in…
  • 2009
2 Excerpts

Traces , executions and schedulers , coalge - braically , in : Proc . CALCO

  • A. Sokolova B. Jacobs
  • Terminal coalgebras for measure - polynomial…
  • 2009

Similar Papers

Loading similar papers…