Permutation rewriting and algorithmic verification

DOI10.1016/J.IC.2005.11.007zbMATH Open1107.68052OpenAlexW2063288032MaRDI QIDQ865624FDOQ865624

Authors: Ahmed Bouajjani, Anca Muscholl, Tayssir Touili 

Publication date: 20 February 2007

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2005.11.007

Recommendations

• The membership problem for linear and regular permutation languages
• Efficiency of automata in semi-commutation verification techniques
• Regular and linear permutation languages
• scientific article; zbMATH DE number 1086501
• CONCUR 2004 - Concurrency Theory

zbMATH Keywords

verificationregular model checkingrewrite systemssemi-commutations

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Regular model checking using widening techniques
• Title not available (Why is that?)
• On recognizable subsets of free partially commutative monoids
• A stubborn attack on state explosion
• An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages
• Classifying regular events in symbolic logic
• Polynomial closure and unambiguous product
• Reachability analysis of pushdown automata: Application to model-checking
• Title not available (Why is that?)
• Symbolic model checking with rich assertional languages
• A partial approach to model checking
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (20)

• Regular languages and partial commutations
• Iterating transducers
• Bounded communication reachability analysis of process rewrite systems with ordered parallelism
• State complexity of permutation and related decision problems on alphabetical pattern constraints
• A note on partially ordered tree automata
• Title not available (Why is that?)
• Automatic Verification of Directory-Based Consistency Protocols
• Complexity of universality and related problems for partially ordered NFAs
• Regular model checking using widening techniques
• Local testability from words to traces, a suitable definition
• Uniform rewriting based on permutations
• Automatic verification of directory-based consistency protocols with graph constraints
• Title not available (Why is that?)
• Efficiency of automata in semi-commutation verification techniques
• A normalized form for FIFO protocols traces, application to the replay of mode-based protocols
• A Robust Class of Regular Languages
• State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs
• The commutative closure of shuffle languages over group languages is regular
• Certifying algorithms and relevant properties of reversible primitive permutations with \textsf{Lean}
• Geometrically closed positive varieties of languages

This page was built for publication: Permutation rewriting and algorithmic verification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q865624)