FOCOVE: Formal Concurrency Verification Environment for Complex Systems

Saïdouni, Djamel Eddine; Benamira, Adel; Belala, Nabil; Arfi, Farid

doi:10.1063/1.2953008

Cited by 4 publications

(4 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Exploiting the RATA model in order to solve optimal jobshop scheduling problems is a novel application of models based maximality-semantics, in addition to verification purpose [9,10]. In our implementation, the optimal scheduling solution is obtained automatically from a simple algebraic description of the problem.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

A model for job-shop problem

Arfi

Saïdouni

2012

2012 International Conference on Information Technology and E-Services

Self Cite

View full text Add to dashboard Cite

In this paper, we present a timed model called Resources Allocation Timed Automata (RATA), expressing parallel behaviors in natural way and supporting at the same time explicit action duration and shared resources. We show how the classical job-shop scheduling problem can be modeled naturally in RATA model, we present also two algorithms for finding the shortest paths in RATA model for the problem of job-shop and test their implementation.

show abstract

Section: Discussionmentioning

confidence: 99%

“…It consists in using true-concurrency semantics like the maximality semantics [7]. To implement such semantics, Maximality-based Labeled Transition Systems (MLTSs) have been defined [8] and used in work relating to the specification and the verification of reactive systems [9,10].…”

Section: Introductionmentioning

confidence: 99%

A model for job-shop problem

Arfi

Saïdouni

2012

2012 International Conference on Information Technology and E-Services

Self Cite

View full text Add to dashboard Cite

show abstract

“…We note that some properties related to reachability may be checked by means of KRONOS and UPPAAL like tools [43,44]. However, for properties dealing with true concurrency behaviors, FOCOVE model checker may be used [45].…”

Section: Formalisationmentioning

confidence: 99%

“…The true-concurrency semantics based DTPN model is used to obtain the durational action Timed Automata (daTA) depicted in Figure 28. The resulting daTA has 42 states and 68 transitions; it is generated automatically using a tool integrated into FOCOVE environment [45]. For this reason, we represent only a fragment of the graph.…”

Section: Verificationmentioning

confidence: 99%

Formal Verification of UML MARTE Specifications Based on a True Concurrency Real Time Model

Chabbat

Saïdouni

Boukharrou

et al. 2020

cai

View full text Add to dashboard Cite

For critical embedded systems the formal validation and verification is required. However, the real-time model checking suffers from problems of statespace explosion and clock explosion. The aim of this paper is to ensure an improvement of the Modeling and Analysis of Real-Time Embedded systems (MARTE), which is de facto standard, with formal semantics for verification finality. Therefore, we propose an operational method for translating UML sequence diagrams with MARTE annotations to Time Petri nets with Action Duration specifications (DTPN). Based on true concurrency semantics, the semantics of these specifications are defined in terms of Duration Action Timed Automata (daTA).

show abstract

Formal Verification of an IoT-Based Railway Gate System

El Abidine Bouneb

2024

Lecture Notes in Networks and Systems

View full text Add to dashboard Cite

FOCOVE: Formal Concurrency Verification Environment for Complex Systems

Cited by 4 publications

References 7 publications

A model for job-shop problem

A model for job-shop problem

Formal Verification of UML MARTE Specifications Based on a True Concurrency Real Time Model

Formal Verification of an IoT-Based Railway Gate System

Contact Info

Product

Resources

About