Compositional Failure-based Equivalence of Constraint Automata

DOI10.1016/j.entcs.2009.08.008zbMath1339.68187OpenAlexW2023255277WikidataQ57835395 ScholiaQ57835395MaRDI QIDQ2810975

Ali Movaghar, Mohammad A. Izadi

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

compositional model checkingconstraint automatacomponent-based systemsequivalence-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)

Related Items (1)

Failure-based equivalence of constraint automata

Uses Software

• Reo

Cites Work

• Abstract behavior types: a foundation model for components and their composition
• Compositional failure-based semantic models for basic LOTOS
• Modeling component connectors in Reo by constraint automata
• Reo: a channel-based coordination model for component composition
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Compositional Failure-based Equivalence of Constraint Automata