Transactional Reduction of Component Compositions

DOI10.1007/978-3-540-73196-2_22MaRDI QIDQ3612363zbMATH OpenOpenAlexFDO

Authors Serge Haddad, Pascal Poizat

Publication date 10 March 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73196-2_22

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 1947732
• Implementation and Application of Automata
• Component composition preserving behavioral contracts based on communication traces
• Coordination Models and Languages
• Composition for component-based modeling

Cites work

• scientific article; zbMATH DE number 1860627 (Why is no real title available?)
• A calculus for reasoning about software composition
• Antichains: A New Algorithm for Checking Universality of Finite Automata
• Efficient on-the-fly model-checking for regular alternation-free -calculus
• Formal methods for software architectures. Third international school on formal methods for the design of computer communication and software systems: Software architectures, SFM 2003, Bertinoro, Italy, September 22--27, 2003. Advanced lectures.
• Handbook of process algebra
• Static Analysis

Cited in

(1)

• An efficient approach to achieve compositionality using optimized multi-version object based transactional systems

Describes a project that uses

Uses Software

• Antichains
• LTSA-WS

This page was built for publication: Transactional Reduction of Component Compositions

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