Linear Temporal Logic on process traces (or LTLp) is a logic introduced to specify and reason over the temporal properties of (the traces generated by) business processes. So far, its relation with finite-state automata has not been explored and researchers resorted to more expressive logics and the corresponding automata construction algorithms. In this paper, we present a tool, named LTLp2DFA, to automatically construct the automata associated with LTLp specifications and show how, by considering process traces as first-class citizens, this results in simpler automata and better construction algorithms.
From LTL on Process Traces to Finite-State Automata / Chiariello, F.; Maggi, F. M.; Patrizi, F.. - 3469:(2023), pp. 127-131. ( International Conference on Business Process Management Utrecht; The Netherlands ).
From LTL on Process Traces to Finite-State Automata
Chiariello F.
;Maggi F. M.;Patrizi F.
2023
Abstract
Linear Temporal Logic on process traces (or LTLp) is a logic introduced to specify and reason over the temporal properties of (the traces generated by) business processes. So far, its relation with finite-state automata has not been explored and researchers resorted to more expressive logics and the corresponding automata construction algorithms. In this paper, we present a tool, named LTLp2DFA, to automatically construct the automata associated with LTLp specifications and show how, by considering process traces as first-class citizens, this results in simpler automata and better construction algorithms.| File | Dimensione | Formato | |
|---|---|---|---|
|
Chiariello_From-LTL_2023.pdf
accesso aperto
Note: https://ceur-ws.org/Vol-3469/paper-23.pdf
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Creative commons
Dimensione
1.02 MB
Formato
Adobe PDF
|
1.02 MB | Adobe PDF |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
