2 citations
- Centre National de la Recherche ScientifiqueFR1 paper
- Chennai Mathematical InstituteIN1 paper
- Indian Institute of Technology BombayIN1 paper
- Laboratoire Bordelais de Recherche en InformatiqueFR1 paper
- Laboratoire Méthodes FormellesFR1 paper
- Laboratoire Spécification et VérificationFR1 paper
- Université de BordeauxFR1 paper
- Université Paris-SaclayFR1 paper
2 papers
cs.FL2021★ 2 cited
Asynchronous wreath product and cascade decompositions for concurrent behaviours
Bharat Adsul, Paul Gastin, Saptarshi Sarkar +1
We develop new algebraic tools to reason about concurrent behaviours modelled as languages of Mazurkiewicz traces and asynchronous automata. These tools reflect the distributed nat…
cs.CC2019★ 1 cited
Verification of Flat FIFO Systems
Alain Finkel, M. Praveen
The decidability and complexity of reachability problems and model-checking for flat counter machines have been explored in detail. However, only few results are known for flat (lo…