Action Synthesis for Branching Time Logic: Theory and Applications
Authors:
- Michal KnapikMKMichal Knapik
- Artur MeskiAMArtur Meski
- Wojciech PenczekWPWojciech Penczek
- 1 June 2014
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-10
Abstract
We introduce a parametric extension of Action-Restricted Computation Tree Logic. A symbolic fixed-point algorithm providing a solution to the exhaustive parameter synthesis problem is proposed. The parametric approach allows for an in-depth system analysis and synthesis of correct parameter values. The time complexity of the problem and of the algorithm is provided. The prototype tool SPATULA, implementing the algorithm, is applied to the analysis of three benchmarks: faulty Train-Gate-Controller, Peterson's Mutual Exclusion Protocol, and a Generic Pipeline Processing network. The experimental results show efficiency and scalability of our approach in comparison with a naive solution to the problem.Keywords
This publication has 10 references indexed in Scilit:
- IMITATOR 2.5: A Tool for Analyzing Robustness in Scheduling Problems2012
- Model Checking Temporal-Epistemic Logic Using Alternating Tree AutomataFundamenta Informaticae, 2011
- Parametric Metric Interval Temporal LogicLecture Notes in Computer Science, 2010
- Code Mutation in Verification and Automatic Code Correction2010
- Durations and parametric model-checking in timed automataACM Transactions on Computational Logic, 2008
- Design and synthesis of synchronization skeletons using branching time temporal logic2005
- Linear parametric model checking of timed automataThe Journal of Logic and Algebraic Programming, 2002
- Parametric temporal logic for “model measuring”ACM Transactions on Computational Logic, 2001
- Parametric real-time reasoning1993
- Myths about the mutual exclusion problemInformation Processing Letters, 1981