Connecting software build with maintaining consistency between models: towards sound, optimal, and flexible building from megamodels. Perdita Stevens. Softw Syst Model 19, 935–958, 2020. 2020 shelley2024-07-26T09:03:55+00:00 Share this content FacebookXLinkedInWhatsAppEmail Related Posts Efficient Inference of Sources and Targets in a Graph with Limited Observations. Efficient Inference of Sources and Targets in a Graph with Limited Observations. Singly exponential translation of alternating weak Büchi automata to unambiguous Büchi automata. Singly exponential translation of alternating weak Büchi automata to unambiguous Büchi automata. History-deterministic Timed Automata. History-deterministic Timed Automata. Learning Weighted Automata over Principal Ideal Domains. FoSSaCS 2020. Lecture Notes in Computer Science, vol 12077. Learning Weighted Automata over Principal Ideal Domains. FoSSaCS 2020. Lecture Notes in Computer Science, vol 12077.
by