Progressive solutions to a parallel automata equation
From MaRDI portal
Publication:3564943
Recommendations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- A discrete event systems approach for protocol conversion
- Bisimulation, the supervisory control problem and strong model matching for finite state machines
- Factorisation of finite state machines under strong and observational equivalences
- On the Construction of Submodule Specifications and Communication Protocols
- Submodule construction as equation solving in CCS
Cited in
(11)- scientific article; zbMATH DE number 7300359 (Why is no real title available?)
- Factorization for component-interaction automata
- Compositionally progressive solutions of synchronous FSM equations
- On the edge-independence number and edge-covering number for regular graphs
- Progressive Solutions to FSM Equations
- Using logic to solve the submodule construction problem
- Progressive solutions to a parallel automata equation
- Approximation of sets of superwords by \(L\)-language formulas
- Design of reactive algorithms by solving equations over automata
- Describing progressive solutions to a parallel FSM equation
- Solving inequalities over finite state machines in the reactive systems design
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)
