Regular Model Checking Made Simple and Efficient
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Extrapolating Tree Transformations
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Languages, Rewriting Systems, and Verification of Infinite-State Systems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
When Does Partial Commutative Closure Preserve Regularity?
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism
Electronic Notes in Theoretical Computer Science (ENTCS)
Constrained Reachability of Process Rewrite Systems
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Regularity Results for FIFO Channels
Electronic Notes in Theoretical Computer Science (ENTCS)
Reachability Problems in Piecewise FIFO Systems
ACM Transactions on Computational Logic (TOCL)
Flat acceleration in symbolic model checking
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Computing transitive closures of hedge transformations
International Journal of Critical Computer-Based Systems
Piecewise FIFO channels are analyzable
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Computing transitive closures of hedge transformations
VECoS'07 Proceedings of the First international conference on Verification and Evaluation of Computer and Communication Systems
Fair Synthesis for Asynchronous Distributed Systems
ACM Transactions on Computational Logic (TOCL)
Regular languages and partial commutations
Information and Computation
Hi-index | 0.00 |
Abstract: We propose a natural subclass of regular languages (Alphabetic Pattern Constraints, APC) which is effectively closed under permutation rewriting, i.e., under iterative application of rules of the form ab \rightarrow ba. It is well-known that regular languages do not have this closure property, in general. Our result can be applied for example to regular model checking, for verifying properties of parametrized linear networks of regular processes, and for modeling and verifying properties of asynchronous distributed systems. We also consider the complexity of testing membership in APC and show that the question is complete for PSPACE when the input is an NFA, and complete for NLOGSPACE when it is a DFA. Moreover, we show that both the inclusion problem and the question of closure under permutation rewriting are PSPACE-complete when we restrict to the class APC.