ICC 25427
INSTITUTO DE INVESTIGACION EN CIENCIAS DE LA COMPUTACION
Unidad Ejecutora - UE
congresos y reuniones científicas
Título:
CLTSA: labelled transition system analyser with counting fluent support
Autor/es:
RENZO DEGIOVANNI; NICOLÁS D'IPPOLITO; GERMÁN REGIS; NAZARENO AGUIRRE
Lugar:
Paderborn
Reunión:
Conferencia; ESEC/SIGSOFT FSE 2017; 2017
Institución organizadora:
ACM
Resumen:
In this paper we present CLTSA (Counting Fluents Labelled Transition System Analyser), an extension of LTSA (Labelled Transition System Analyser) that incorporates counting fluents, a useful mechanism to capture properties related to counting events. Counting fluent temporal logic is a formalism for specifying properties of event-based systems, which complements the notion of fluent by the related concept of counting fluent. While fluents allow us to capture boolean properties of the behaviour of a reactive system, counting fluents are numerical values, that enumerate event occurrences.The tool supports a superset of FSP (Finite State Processes), that allows one to define LTL properties involving counting fluents, which can be model checked on FSP processes. Detailed information can be found at http://dc.exa.unrc.edu.ar/tools/cltsa.
