On-the-fly bisimilarity checking for fresh-register automata

DOI10.1007/978-3-031-21213-0_12zbMath1528.68172OpenAlexW4312325155MaRDI QIDQ6168987

M. H. Bandukara, Nikos Tzevelekos

Publication date: 10 August 2023

Published in: Dependable Software Engineering. Theories, Tools, and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-21213-0_12

zbMATH Keywords

nominal automataautomata over infinite languagesbisimulation equivalence checking

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automata for XML -- a survey
• Efficient representation of perm groups
• A calculus of mobile processes. I
• A calculus for cryptographic protocols: The spi calculus
• Finite-memory automata
• Intractability of decision problems for finite-memory automata
• Algorithmic games for full ground references
• Computing bisimulations for finite-control \(\pi\)-calculus
• Learning Register Automata with Fresh Value Generation
• Automata theory in nominal sets
• A Robust Class of Data Languages and an Application to Learning
• Algorithmic Nominal Game Semantics
• A Contextual Equivalence Checker for IMJ*
• Variable Automata over Infinite Alphabets
• On the length of subgroup chains in the symmetric group
• Bisimilarity in Fresh-Register Automata
• Polynomial-time equivalence testing for deterministic fresh-register automata
• Finite state machines for strings over infinite alphabets
• Runtime Verification Based on Register Automata
• LOIS: syntax and semantics
• Learning nominal automata
• Fresh-register automata
• The algorithmics of bisimilarity

This page was built for publication: On-the-fly bisimilarity checking for fresh-register automata