Permutation rewriting and algorithmic verification

DOI10.1016/J.IC.2005.11.007MaRDI QIDQ865624zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 1670786 (Why is no real title available?)
• scientific article; zbMATH DE number 1232242 (Why is no real title available?)
• scientific article; zbMATH DE number 1538041 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 2102701 (Why is no real title available?)
• scientific article; zbMATH DE number 1418329 (Why is no real title available?)
• A partial approach to model checking
• A stubborn attack on state explosion
• An algorithmic approach for checking closure properties of temporal logic specifications and -regular languages
• Classifying regular events in symbolic logic
• On recognizable subsets of free partially commutative monoids
• Polynomial closure and unambiguous product
• Reachability analysis of pushdown automata: Application to model-checking
• Regular model checking using widening techniques
• Symbolic model checking with rich assertional languages

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
• scientific article; zbMATH DE number 7283890 (Why is no real title available?)
• Complexity of universality and related problems for partially ordered NFAs
• Automatic Verification of Directory-Based Consistency Protocols
• Local testability from words to traces, a suitable definition
• Regular model checking using widening techniques
• Uniform rewriting based on permutations
• Automatic verification of directory-based consistency protocols with graph constraints
• scientific article; zbMATH DE number 7350780 (Why is no real title available?)
• 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
• The commutative closure of shuffle languages over group languages is regular
• State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs
• 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)