Mediator Synthesis in a Component Algebra with Data

DOI10.1007/978-3-319-23506-6_16zbMath1444.68103OpenAlexW2296360911MaRDI QIDQ3449636

Lukáš Holík, Malte Isberner, Bengt Jonsson

Publication date: 4 November 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-319-23506-6_16

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 (2)

A linear-time branching-time perspective on interface automata ⋮ Interface automata for shared memory

Cites Work

• Specification-oriented semantics for communicating processes
• Interface synthesis and protocol conversion
• A Compositional Specification Theory for Component Behaviours
• A Modal Interface Theory for Component-based Design
• Algorithms for Omega-Regular Games with Imperfect Information
• Modal I/O Automata for Interface and Product Line Theories

This page was built for publication: Mediator Synthesis in a Component Algebra with Data