Fault-free refinements for interface automata

DOI10.7561/SACS.2018.2.289MaRDI QIDQ4621227zbMATH OpenWikidataFDO

Authors Ayleen Schinko, Walter Vogler

Publication date 8 February 2019

Published in Scientific Annals of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7561/SACS.2018.2.289

zbMATH Keywords

conjunctiondivergenceprecongruencequiescencequotientrefinement

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Error-pruning in interface automata
• Error-pruning in interface automata
• An algebraic theory of interface automata
• Relational concurrent refinement
• Modal Interface Automata

Cited in

(5)

• A linear-time branching-time perspective on interface automata
• Richer interface automata with optimistic and pessimistic compatibility
• Error-pruning in interface automata
• Interface automata for shared memory
• Error-pruning in interface automata

This page was built for publication: Fault-free refinements for interface automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4621227)