Checking NFA equivalence with bisimulations up to congruence
From MaRDI portal
Publication:2931822
DOI10.1145/2429069.2429124zbMath1301.68169MaRDI QIDQ2931822
Publication date: 27 November 2014
Published in: Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2429069.2429124
68Q45: Formal languages and automata
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Coinductive predicates and final sequences in a fibration, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Up-To Techniques for Behavioural Metrics via Fibrations, Coinductive Algorithms for Büchi Automata, Equations, Contractions, and Unique Solutions, Enhanced coalgebraic bisimulation, Verified decision procedures for MSO on words based on derivatives of regular expressions, Automata Learning: A Categorical Perspective, Unnamed Item, Unnamed Item, Abstraction refinement and antichains for trace inclusion of infinite state systems, Formal methods for NFA equivalence: QBFs, witness extraction, and encoding verification, Coinductive predicates and final sequences in a fibration, Algorithms for Kleene algebra with converse, The dual equivalence of equations and coequations for automata, A general account of coinduction up-to, Proving language inclusion and equivalence by coinduction, A theoretical framework for cardinality-based feature models: the semantics and computational aspects, (in)finite trace equivalence of probabilistic transition systems, Coalgebraic semantics for nominal automata, A symbolic decision procedure for symbolic alternating finite automata, Manipulation of regular expressions using derivatives: an overview, Bisimulation and coinduction enhancements: a historical perspective, Robust biomolecular finite automata, Mechanized metatheory revisited, Completeness and incompleteness in nominal Kleene algebra, Extracting Proofs from Tabled Proof Search, Deciding Synchronous Kleene Algebra with Derivatives, Final Semantics for Decorated Traces, Fair Termination for Parameterized Probabilistic Concurrent Systems, Up-To Techniques for Weighted Systems, Nominal Kleene Coalgebra, Width of Non-deterministic Automata
