Souheib Baarir

Followers

Following

Co-author

Public Views

Doç. Dr. Gülsün Nakıboğlu

Istanbul Technical University

Kamelia Spassova

Sofia University "St. Kliment Ohridski"

Ami Kawaii

El-Hadj Lakhdar

Nada Thurman

Faculty of Law, Economics and Management Jendouba, Tunisia

Rania Kthiri

Iset Rades

Aboubakr El Hammoumi

Abdelmalek Essaâdi University

Mara Mbaye

University of Oxford

Kaouther Nouira

ISG-Tunis

Mostapha Zbakh

Mohammad 5 University-Agdal Rabat

Armando Marques-Guedes

UNL - New University of Lisbon

Interests

Uploads

Papers by Souheib Baarir

Exploitation des symétries partielles pour la vérification et l'évaluation de performances des systèmes finis

Http Www Theses Fr, 2007

Test de vacuité pour automates de Büchi ensemblistes avec tests d'inclusion

RÉSUMÉ. Nous présentons deux algorithmes d&#x27;emptiness check pour les automates de Büchi d... more RÉSUMÉ. Nous présentons deux algorithmes d&#x27;emptiness check pour les automates de Büchi dont les états sont des ensembles qui peuvent s&#x27;inclure les uns les autres. Le premier est équivalent à un emptiness check traditionnel, mais utilise des tests d&#x27;inclusion pour diriger la ...

V�rification formelle d'un algorithme g�n�rique et hi�rarchique d'exclusion mutuelle

Tsi, 2009

Publications of Denis Poitrenaud

Exploiting Partial Symmetries in Well-formed nets for the Reachability and the Linear Time Model Checking Problems

Taking advantage of the symmetries of a system is an efficient way to cope with the combinatory e... more Taking advantage of the symmetries of a system is an efficient way to cope with the combinatory explosion involved by the verification process. Whereas numerous algorithms and tools efficiently deal with the verification of a symmetrical formula on a symmetrical model, the management of partial symmetries is still an open research topic. In this work, we present the design and the evaluation of two methods applicable on coloured Petri nets. These two methods are extensions of the symbolic reachability graph construction for the wellformed Petri nets. The first algorithm, called the extended symbolic reachability graph construction, tackles the reachability problem. The second one, called the symbolic synchronized product, checks a partially symmetric linear time formula on a net. The evaluations show that these two methods outperform the previous approaches dealing with partial symmetries. Furthermore they are complementary ones since the former while being less general gives better results than the latter when applied to the reachability problem.

Download

$Research paper thumbnail of SAT-Based Minimization of Deterministic $$\omega $$ -Automata$

SAT-Based Minimization of Deterministic $$\omega $$ -Automata

Lecture Notes in Computer Science, 2015

A framework to formally verify conformance of a software process to a software method

Proceedings of the 30th Annual ACM Symposium on Applied Computing - SAC '15, 2015

Improving reachability analysis for partially symmetric high level Petri nets

Download

Formalization of fUML: An Application to Process Verification

Lecture Notes in Computer Science, 2014

Nouvelles techniques de Model Checking pour la vérification de systèmes complexes

Download

Alloy4SPV : A Formal Framework for Software Process Verification

Lecture Notes in Computer Science, 2014

Planning for declarative processes

Proceedings of the 29th Annual ACM Symposium on Applied Computing - SAC '14, 2014

On the use of exact lumpability in partially symmetrical well-formed nets

Second International Conference on the Quantitative Evaluation of Systems (QEST'05), 2005

have proved an efficient model for building quotient reachability graphs that can be used either ... more have proved an efficient model for building quotient reachability graphs that can be used either for qualitative or performance analysis. However, local asymmetries often break any possibility of grouping states into classes, thus drastically reducing the interest of the approach. An efficient solution has been proposed for qualitative analysis, which relies on a separate representation of the asymmetries in a so-called control automaton. The quotient graph is then obtained by synchronising the transitions of the WN model with the transitions of the control automaton. In this paper, we improve this approach to quantitative analysis. We show that it can be used to build an aggregated graph that is isomorphic to a Markov chain which verifies exact lumpability. Theoretical considerations and practical experiments show that our method outperforms previous approaches.

Download

The GreatSPN tool: recent enhancements

ACM SIGMETRICS Performance Evaluation Review

GreatSPN is a tool that supports the design and the qualitative and quantitative analysis of Gene... more GreatSPN is a tool that supports the design and the qualitative and quantitative analysis of Generalized Stochastic Petri Nets (GSPN) and of Stochastic Well-Formed Nets (SWN). The very first version of GreatSPN saw the light in the late eighties of last century: since then two main releases where developed and widely distributed to the research community: GreatSPN1.7 [13], and GreatSPN2.0 [8]. This paper reviews the main functionalities of GreatSPN2.0 and presents some recently added features that significantly enhance the efficacy of the tool.

Download

Mechanizing the Minimization of Deterministic Generalized Büchi Automata

Lecture Notes in Computer Science, 2014

Verification of a Hierarchical Generic Mutual Exclusion Algorithm

Lecture Notes in Computer Science, 2008

In distributed environments, the shared resources access control by mutual exclusion paradigm is ... more In distributed environments, the shared resources access control by mutual exclusion paradigm is a recurrent key problem. To cope with the new constraints implied by recently developed large scale distributed systems like grids, mutual exclusion algorithms become more and more complex and thus much harder to prove and/or verify. In this article, we propose the formal modeling and the verification of a new generic hierarchical approach. This approach is based on the composition of classical already proof checked distributed algorithms. It overcomes some limitations of these classical algorithms by taking into account the network topology latencies and have a high scalability where centralized ones don't. We also have formalized the properties of the mutual exclusion paradigm in order to verify them against our solution. We prove that our compositional approach preserves theses properties under the assumption that all used plain algorithms assert them. This verification by formal method checkers was eased by the efficient use of already proved mutual exclusion algorithms and the reduction of state spaces by exploiting the symmetries.

Download

Vérification formelle d'un algorithme générique et hiérarchique d'exclusion mutuelle

Techniques et sciences informatiques, 2009

Tutorial 1: Modeling and Verifying Distributed Systems with Petri Nets

2012 Second International Workshop on Advanced Information Systems for Enterprises, 2012

ABSTRACT The objective of this tutorial is to focus on one technique that is suitable for the mod... more

State Space Analysis Using Symmetries on Decision Diagrams

2012 12th International Conference on Application of Concurrency to System Design, 2012

ABSTRACT Two well-accepted techniques to tackle combinatorial explosion in model-checking are exp... more ABSTRACT Two well-accepted techniques to tackle combinatorial explosion in model-checking are exploitation of symmetries and the use of reduced decision diagrams. Some work showed that these two techniques can be stacked in specific cases. This paper presents a novel and more general approach to combine these two techniques. Expected benefits of this combination are:· in symmetry-based reduction, the main source of complexity resides in the canonization computation that must be performed for each new encountered state, the use of shared decision diagrams allows one to canonize sets of states at once.· in decision diagram based techniques, dependencies between variables induce explosion in representation size, the manipulation of canonical states allows to partly overcome this limitation. We show that this combination is experimentally effective in many typical cases.

Towards Distributed Software Model-Checking Using Decision Diagrams

Lecture Notes in Computer Science, 2013

ABSTRACT Symbolic data structures such as Decision Diagrams have proved successful for model-chec... more ABSTRACT Symbolic data structures such as Decision Diagrams have proved successful for model-checking. For high-level specifications such as those used in programming languages, especially when manipulating pointers or arrays, building and evaluating the transition is a challenging problem that limits wider applicability of symbolic methods. We propose a new symbolic algorithm, EquivSplit, allowing an efficient and fully symbolic manipulation of transition relations on Data Decision Diagrams. It allows to work with equivalence classes of states rather than individual states. Experimental evidence on the concurrent software oriented benchmark BEEM shows that this approach is competitive.

Exploitation des symétries partielles pour la vérification et l'évaluation de performances des systèmes finis

Http Www Theses Fr, 2007

Test de vacuité pour automates de Büchi ensemblistes avec tests d'inclusion

V�rification formelle d'un algorithme g�n�rique et hi�rarchique d'exclusion mutuelle

Tsi, 2009

Publications of Denis Poitrenaud

Exploiting Partial Symmetries in Well-formed nets for the Reachability and the Linear Time Model Checking Problems

Download

$Research paper thumbnail of SAT-Based Minimization of Deterministic $$\omega $$ -Automata$

SAT-Based Minimization of Deterministic $$\omega $$ -Automata

Lecture Notes in Computer Science, 2015

A framework to formally verify conformance of a software process to a software method

Proceedings of the 30th Annual ACM Symposium on Applied Computing - SAC '15, 2015

Improving reachability analysis for partially symmetric high level Petri nets

Download

Formalization of fUML: An Application to Process Verification

Lecture Notes in Computer Science, 2014

Nouvelles techniques de Model Checking pour la vérification de systèmes complexes

Download

Alloy4SPV : A Formal Framework for Software Process Verification

Lecture Notes in Computer Science, 2014

Planning for declarative processes

Proceedings of the 29th Annual ACM Symposium on Applied Computing - SAC '14, 2014

On the use of exact lumpability in partially symmetrical well-formed nets

Second International Conference on the Quantitative Evaluation of Systems (QEST'05), 2005

Download

The GreatSPN tool: recent enhancements

ACM SIGMETRICS Performance Evaluation Review

Download

Mechanizing the Minimization of Deterministic Generalized Büchi Automata

Lecture Notes in Computer Science, 2014

Verification of a Hierarchical Generic Mutual Exclusion Algorithm

Lecture Notes in Computer Science, 2008

Download

Vérification formelle d'un algorithme générique et hiérarchique d'exclusion mutuelle

Techniques et sciences informatiques, 2009

Tutorial 1: Modeling and Verifying Distributed Systems with Petri Nets

2012 Second International Workshop on Advanced Information Systems for Enterprises, 2012

ABSTRACT The objective of this tutorial is to focus on one technique that is suitable for the mod... more

State Space Analysis Using Symmetries on Decision Diagrams

2012 12th International Conference on Application of Concurrency to System Design, 2012

Towards Distributed Software Model-Checking Using Decision Diagrams

Lecture Notes in Computer Science, 2013

Souheib Baarir

Related Authors

Uploads

Papers by Souheib Baarir

Log In