Progressive solutions to a parallel automata equation
From MaRDI portal
Publication:3564943
DOI10.1007/978-3-540-39979-7_24zbMATH Open1279.68135OpenAlexW1534650838MaRDI QIDQ3564943FDOQ3564943
Authors: Sergey Buffalov, Khaled El-Fakih, Nina Yevtushenko, Gregor von Bochmann 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Factorisation of finite state machines under strong and observational equivalences
- Submodule construction as equation solving in CCS
- On the Construction of Submodule Specifications and Communication Protocols
- Bisimulation, the supervisory control problem and strong model matching for finite state machines
- A discrete event systems approach for protocol conversion
Cited In (11)
- Compositionally progressive solutions of synchronous FSM equations
- Using logic to solve the submodule construction problem
- Solving inequalities over finite state machines in the reactive systems design
- Title not available (Why is that?)
- On the edge-independence number and edge-covering number for regular graphs
- Design of reactive algorithms by solving equations over automata
- Describing progressive solutions to a parallel FSM equation
- Factorization for component-interaction automata
- Progressive solutions to a parallel automata equation
- Progressive Solutions to FSM Equations
- Approximation of sets of superwords by \(L\)-language formulas
This page was built for publication: Progressive solutions to a parallel automata equation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564943)
