Progressive solutions to a parallel automata equation

DOI10.1016/J.TCS.2006.05.034zbMath1100.68047OpenAlexW2025639547MaRDI QIDQ2508960

Sergey Buffalov, Khaled El-Fakih, Nina Yevtushenko, Gregor von Bochmann

Publication date: 20 October 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.05.034

zbMATH Keywords

progressive solutionsequation solvingparallel automata equations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Compositionally progressive solutions of synchronous FSM equations

Cites Work

• Unnamed Item
• Factorisation of finite state machines under strong and observational equivalences
• Submodule construction as equation solving in CCS
• Bisimulation, the supervisory control problem and strong model matching for finite state machines
• A discrete event systems approach for protocol conversion
• Progressive Solutions to a Parallel Automata Equation
• On the Construction of Submodule Specifications and Communication Protocols
• Formal Techniques for Networked and Distributed Systems – FORTE 2004

This page was built for publication: Progressive solutions to a parallel automata equation