Automated Synthesis of Application-Layer Connectors from Automata-Based Specifications
From MaRDI portal
Publication:2799159
DOI10.1007/978-3-319-15579-1_1zbMath1423.68065OpenAlexW201769302WikidataQ124326875 ScholiaQ124326875MaRDI QIDQ2799159
Paola Inverardi, Romina Spalazzese, Massimo Tivoli, Marco Autili, Filippo Mignosi
Publication date: 8 April 2016
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-15579-1_1
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Distributed systems (68M14) Network protocols (68M12)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A basic algebra of stateless connectors
- Failure-free coordinators synthesis for component-based architectures
- A Compositional Specification Theory for Component Behaviours
- Trace languages defined by regular string languages
- Supervisory Control of a Class of Discrete Event Processes
- Formal verification of parallel programs
- Supervisory control of timed discrete-event systems
- Characterizations of the decidability of some problems for regular trace languages
This page was built for publication: Automated Synthesis of Application-Layer Connectors from Automata-Based Specifications
