Efficient Algorithms and Tools for MITL Model-Checking and Synthesis

Brihaye, Thomas; Geeraerts, Gilles; Ho, Hsi-Ming; Milchior, Arthur; Monmege, Benjamin

doi:10.1109/iceccs2018.2018.00027

Cited by 3 publications

(3 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…) collision_a f ter _transm := G (0,52] (P 1 .send ∧ (P 1 .send U [0,inf ) (P 1 .send ∧ P 2 .send))) (13) The property live-csma predicates on the occurrence of a collision-i.e., P 1 and P 2 simultaneously sending a message. It specifies that a collision does not occur after P 1 is transmitting for 52 time units or more.…”

Section: Live-csmamentioning

confidence: 99%

“…Thus, formula P 1 .start_send is true when P 1 starts sending a message. Let us now consider formula collision_a f ter _transm (13), which specifies that P 1 transmits for 52 time units or more, and then a collision is detected. Operator G (0,52] forces formula (P 1 .send) ∧ (P 1 .send U [0,∞) (P 1 .send ∧ P 2 .send))) to hold continuously from the current time instant, until 52 time units from now, included.…”

Section: Live-csmamentioning

confidence: 99%

“…It is however still unknown whether MITL 0,∞ is equivalent to MITL under the latter semantics. There are several procedures to convert MITL specifications into TA [5,28], but, to the best of our knowledge, only one has been successfully implemented [13][14][15]. These procedures could be the basis for a model checking tool that (i) transforms the MITL formula to be checked into (a set of) TA; (ii) combines the obtained automata with a network of TA modeling the system; and (iii) performs an emptiness check on the result.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Model Checking MITL Formulae on Timed Automata

Menghi

Bersani

Rossi

et al. 2020

ACM Trans. Comput. Logic

View full text Add to dashboard Cite

Timed Automata (TA) is de facto a standard modelling formalism to represent systems when the interest is the analysis of their behaviour as time progresses. This modelling formalism is mostly used for checking whether the behaviours of a system satisfy a set of properties of interest. Even if efficient model-checkers for Timed Automata exist, these tools are not easily configurable. First, they are not designed to easily allow adding new Timed Automata constructs, such as new synchronization mechanisms or communication procedures, but they assume a fixed set of Timed Automata constructs. Second, they usually do not support the Metric Interval Temporal Logic (MITL) and rely on a precise semantics for the logic in which the property of interest is specified, which cannot be easily modified and customized. Finally, they do not easily allow using different solvers that may speed up verification in different contexts. This article presents a novel technique to perform model checking of Metric Interval Temporal Logic (MITL) properties on TA. The technique relies on the translation of both the TA and the MITL formula into an intermediate Constraint LTL over clocks (CLTLoc) formula, which is verified through an available decision procedure. The technique is flexible, since the intermediate logic allows the encoding of new semantics as well as new TA constructs, by just adding new CLTLoc formulae. Furthermore, our technique is not bound to a specific solver as the intermediate CLTLoc formula can be verified using different procedures.

show abstract

Section: Live-csmamentioning

confidence: 99%

Section: Live-csmamentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Model Checking MITL Formulae on Timed Automata

Menghi

Bersani

Rossi

et al. 2020

ACM Trans. Comput. Logic

View full text Add to dashboard Cite

show abstract

Structural Synthesis of PLC Program for Real-Time Specification Patterns

Xie

Wei

Yin

et al. 2022

Int. J. Found. Comput. Sci.

View full text Add to dashboard Cite

Among all the reactive synthesis methods, the results of the structural synthesis have the best interpretability and traceability. However, existing structural synthesis method cannot deal with real-time specifications and specifications with circular dependencies. A structural synthesis method for Programmable Logic Controller programs is proposed. First, a real-time specification pattern language, RTSPS4Syn, is proposed. Under the condition that there is no circular dependency between the specification items, the implementations of a specification item are assembled structurally from the implementation of its scope and property expression; and the programs for the specification items are concatenated according to the order of priority and dependency to obtain the synthesized program. This paper presents a method to eliminate the circular dependence of specifications, such that the synthesis approach can be applied to specifications with circular dependency. Furthermore, this paper presents an approach for setting the preset values of timers when considering tolerance on the duration of the delay. The synthesis method does not need to check the conflict and determine the nondeterministic part of the specifications. These problems are solved in existing research by constraint solving in PSPACE.

show abstract

Supporting Dynamic Workflows with Automatic Extraction of Goals from BPMN

Sabatucci

Cossentino

2019

ACM Trans. Auton. Adapt. Syst.

View full text Add to dashboard Cite

Organizations willing to employ workflow technology have to be prepared to undertake a significant investment of time and effort due to the exceptionally dynamic nature of the business environment. Today, it is unlikely that processes are modeled once to be repeatedly executed without any changes. Goal-oriented dynamic workflows are a promising approach to provide flexibility to the execution of business processes. Many goal-oriented frameworks exist in the literature to be used for the purpose. However, modeling goals is a burden for the business analyst. This work proposes an automatic approach for extracting goals from a business process for supporting adaptive workflows. The approach consists of a static analysis of the global workflow state. Goals derive from individual BPMN elements and their interactions. For validating the theory, we developed the BPMN2Goals tool, which has been used for supporting a middleware for self-adaptation.

show abstract

Efficient Algorithms and Tools for MITL Model-Checking and Synthesis

Cited by 3 publications

References 18 publications

Model Checking MITL Formulae on Timed Automata

Model Checking MITL Formulae on Timed Automata

Structural Synthesis of PLC Program for Real-Time Specification Patterns

Supporting Dynamic Workflows with Automatic Extraction of Goals from BPMN

Contact Info

Product

Resources

About