Compositional failure-based equivalence of constraint automata

DOI10.1016/J.ENTCS.2009.08.008MaRDI QIDQ2810975zbMATH OpenOpenAlexWikidataFDO

Authors Mohammad Izadi, Ali Movaghar

Publication date 6 June 2016

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2009.08.008

zbMATH Keywords

component-based systemscompositional model checkingconstraint automataequivalence-based reductionfailure-based equivalences

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Failure-based equivalence of constraint automata
• Modeling component connectors in Reo by constraint automata
• An Alternative Algorithm for Constraint Automata Product
• Automata based model checking for Reo connectors
• Recasting Constraint Automata into Büchi Automata

Cites work

• Abstract behavior types: a foundation model for components and their composition
• Compositional failure-based semantic models for basic LOTOS
• scientific article; zbMATH DE number 4180789 (Why is no real title available?)
• scientific article; zbMATH DE number 3926220 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 52331 (Why is no real title available?)
• scientific article; zbMATH DE number 177514 (Why is no real title available?)
• scientific article; zbMATH DE number 2087388 (Why is no real title available?)
• Modeling component connectors in Reo by constraint automata
• Reo: a channel-based coordination model for component composition

Cited in

(10)

• From symbolic constraint automata to Promela
• Modeling component connectors in Reo by constraint automata
• Data optimizations for constraint automata
• Automated analysis of Reo circuits using symbolic execution
• Failure-based equivalence of constraint automata
• Automata based model checking for Reo connectors
• An Alternative Algorithm for Constraint Automata Product
• Symbolic execution of Reo circuits using constraint automata
• Toward sequentializing overparallelized protocol code
• Recasting Constraint Automata into Büchi Automata

Describes a project that uses

Uses Software

• Reo

This page was built for publication: Compositional failure-based equivalence of constraint automata

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