Fault-free refinements for interface automata

DOI10.7561/SACS.2018.2.289zbMATH Open1424.68088WikidataQ129187925 ScholiaQ129187925MaRDI QIDQ4621227FDOQ4621227

Authors: Ayleen Schinko, Walter Vogler 

Publication date: 8 February 2019

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

Recommendations

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

zbMATH Keywords

divergencequotientquiescencerefinementconjunctionprecongruence

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (5)

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

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)