CLTSA: labelled transition system analyser with counting fluent support
Pages 979 - 983
Abstract
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.
References
[1]
D. Giannakopoulou and J. Magee, Fluent Model Checking for Event-based Systems, in Proc. of ESEC/FSE’03, ACM, pp. 257-266, 2003.
[2]
N. D’Ippolito, D. Fischbein, M. Chechik, S. Uchitel, MTSA: The Modal Transition System Analyser, 23rd IEEE/ACM International Conference on Automated Software Engineering, ASE 2008, L’Aquila, Italy, 2008.
[3]
M. Dwyer, G. Avrunin and J. Corbett, Patterns in Property Specifications for Finitestate Verification, in Proc. of ICSE’99, ACM, pp. 411-420, 1999.
[4]
H. Foster, S. Uchitel, J. Magee, J. Kramer, LTSA-WS: a tool for model-based verification of web service compositions and choreography, 28th International Conference on Software Engineering (ICSE 2006), Shanghai, China, 2006.
[5]
C. A. R. Hoare, Communicating sequential processes, Prentice-Hall 1985.
[6]
C. Delforge, C. Pecheur http://lvl.info.ucl.ac.be/Tools/LTSADelforge
[7]
Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems - Specification -, Springer, 1991.
[8]
Z. Manna and A. Pnueli, Temporal Verification of Reactive Systems -Safety-, Springer, 1995.
[9]
J. Magee and J. Kramer, Concurrency: State Models and Java Programs, John Wiley & Sons, 1999.
[10]
R. Milner, Communication and Concurrency, Prentice-Hall, 1989.
[11]
G. Regis, N. Ricci, N. Aguirre, T. S. E. Maibaum, Specifying and Verifying Declarative Fluent Temporal Logic Properties of Workflows, Formal Methods: Foundations and Applications - 15th Brazilian Symposium, SBMF 2012, Natal, Brazil, 2012.
[12]
G. Regis, F. Villar, N. Ricci, Fluent Logic Workflow Analyser: A Tool for The Verification of Workflow Properties, Proceedings First Latin American Workshop on Formal Methods, LAFM 2013, Buenos Aires, Argentina, 2013.
[13]
G. Regis, R. Degiovanni, N. D’Ippolito, N. Aguirre, Specifying Event-Based Systems with a Counting Fluent Temporal Logic, 37th IEEE/ACM International Conference on Software Engineering, ICSE 2015, Vol. 1, 2015.
[14]
P. Rodrigues, E. Lupu, J. Kramer, LTSA-PCA: tool support for compositional reliability analysis, 36th International Conference on Software Engineering, ICSE 2014, Companion Proceedings, Hyderabad, India, 2014.
[15]
Abstract 1 Introduction 2 Introducing CLTSA 3 Architectural Overview 4 Remarks Acknowledgments References
Index Terms
- CLTSA: labelled transition system analyser with counting fluent support
Recommendations
Specifying event-based systems with a counting fluent temporal logic
ICSE '15: Proceedings of the 37th International Conference on Software Engineering - Volume 1Fluent linear temporal logic is a formalism for specifying properties of event-based systems, based on propositions called fluents, defined in terms of activating and deactivating events. In this paper, we propose complementing the notion of fluent by ...
Formal specification and verification of a coordination protocol for an automated air traffic control system
Safe separation between aircraft is the primary consideration in air traffic control. To achieve the required level of assurance for this safety-critical application, the Automated Airspace Concept (AAC) proposes three levels of conflict detection and ...
Another Look at LTL Model Checking
We show how LTL model checking can be reduced to CTL model checking with fairness constraints. Using this reduction, we also describe how to construct a {\em symbolic} LTL model checker that appears to be quite efficient in practice. In particular, we ...
Comments
Information & Contributors
Information
Published In
August 2017
1073 pages
ISBN:9781450351058
DOI:10.1145/3106237
- General Chairs:
- Eric Bodden,
- Wilhelm Schäfer,
- Program Chairs:
- Arie van Deursen,
- Andrea Zisman
Copyright © 2017 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 21 August 2017
Check for updates
Author Tags
Qualifiers
- Short-paper
Funding Sources
Conference
ESEC/FSE'17
Sponsor:
ESEC/FSE'17: Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering
September 4 - 8, 2017
Paderborn, Germany
Acceptance Rates
Overall Acceptance Rate 112 of 543 submissions, 21%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 137Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 22 Sep 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in