Progressive Solutions to a Parallel Automata Equation

DOI10.1007/978-3-540-39979-7_24zbMath1279.68135OpenAlexW1534650838MaRDI QIDQ3564943

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

Publication date: 26 May 2010

Published in: Formal Techniques for Networked and Distributed Systems - FORTE 2003 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-39979-7_24

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Using logic to solve the submodule construction problem ⋮ Approximation of sets of superwords by \(L\)-language formulas ⋮ Design of reactive algorithms by solving equations over automata ⋮ Progressive solutions to a parallel automata equation ⋮ Compositionally progressive solutions of synchronous FSM equations ⋮ Unnamed Item ⋮ Unnamed Item

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
• On the Construction of Submodule Specifications and Communication Protocols

This page was built for publication: Progressive Solutions to a Parallel Automata Equation