Characteristic Formulae: From Automata to Logic

Forfattere

  • Luca Aceto
  • Anna Ingólfsdóttir

DOI:

https://doi.org/10.7146/brics.v14i2.21925

Resumé

This paper discusses the classic notion of characteristic formulae for processes using variations on Hennessy-Milner logic as the underlying logical specification language. It is shown how to characterize logically (states of) finite labelled transition systems modulo bisimilarity using a single formula in Hennessy-Milner logic with recursion. Moreover, characteristic formulae for timed automata with respect to timed bisimilarity and the faster-than preorder of Moller and Tofts are offered in terms of the logic L_nu of Laroussinie, Larsen and Weise.

Downloads

Publiceret

2007-01-12

Citation/Eksport

Aceto, L., & Ingólfsdóttir, A. (2007). Characteristic Formulae: From Automata to Logic. BRICS Report Series, 14(2). https://doi.org/10.7146/brics.v14i2.21925

Nummer

Nr. 2 (2007): RS-2 Characteristic Formulae: From Automata to Logic

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).