Formal Verification for Components and Connectors

DOI10.1007/978-3-642-04167-9_5zbMath1254.68143OpenAlexW1553374920MaRDI QIDQ3638992

Joachim Klein, Sascha Klüppelholz, Tobias Blechmann, Christel Baier

Publication date: 28 October 2009

Published in: Formal Methods for Components and Objects (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04167-9_5

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

Reo + \(\mathrm{mCRL2}\): a framework for model-checking dataflow in service compositions ⋮ Most General Property-Preserving Updates ⋮ Static and dynamic property-preserving updates ⋮ Compositional construction of most general controllers

Uses Software

• Reo

Cites Work

• Unnamed Item
• Tableau-based automata construction for dynamic linear time temporal logic
• CCS expressions, finite state processes, and three problems of equivalence
• Characterizing finite Kripke structures in propositional temporal logic
• Dynamic linear time temporal logic
• Symbolic model checking for channel-based component connectors
• Modeling component connectors in Reo by constraint automata
• Alternating-time temporal logic
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Reo: a channel-based coordination model for component composition

This page was built for publication: Formal Verification for Components and Connectors