Search


Volume

Author

Year

  • < Previous
  • 1
  • Next >
2 results

Counting CTL

François Laroussinie ; Antoine Meyer ; Eudes Petonnet.
This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying certain sub-formulas along paths. By selecting the combinations of Boolean and arithmetic operations allowed in constraints,&nbsp;[&hellip;]
Published on February 15, 2013
Volume 9, Issue 1

Context-Sensitive Languages, Rational Graphs and Determinism

Arnaud Carayol ; Antoine Meyer.
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its language is the set of all words labelling a path from an initial vertex to a final vertex. In 2001, Morvan and Stirling&nbsp;[&hellip;]
Published on July 19, 2006
Volume 2, Issue 2
  • < Previous
  • 1
  • Next >