Deciding choreography realizability
From MaRDI portal
Publication:2942872
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cited in
(32)- Conversation protocols: a formalism for specification and verification of reactive electronic services
- Compliance in behavioural contracts: a brief survey
- Realizability and dynamic reconfiguration of chor specifications
- Synchronizability for Verification of Asynchronously Communicating Systems
- Event-B-supported choreography-defined communicating systems
- Resolving non-determinism in choreographies
- Contracts as games on event structures
- Relating two automata-based models of orchestration and choreography
- Certifying choreography compilation
- Conversation protocols: a formalism for specification and verification of reactive electronic services
- A modular framework for verifying versatile distributed systems
- An abstract framework for choreographic testing
- An abstract framework for choreographic testing
- A Theory of Formal Choreographic Languages
- A dynamic temporal logic for quality of service in choreographic models
- Realizable temporal logics for web service choreography
- Declarative choreographies and liveness
- Analyzing Chor specifications by translation into FSP
- On deciding synchronizability for asynchronously communicating systems
- Automatic analysis of complex interactions in microservice systems
- Counterexample guided synthesis of monitors for realizability enforcement
- Realizable causal-consistent reversible choreographies for systems with first-in-first-out communication channels
- From communicating machines to graphical choreographies
- scientific article; zbMATH DE number 6703933 (Why is no real title available?)
- Multiparty testing preorders
- A normalized form for FIFO protocols traces, application to the replay of mode-based protocols
- From global choreographies to verifiable efficient distributed implementations
- Choreographies, logically
- A predicate transformer for choreographies. Computing preconditions in choreographic programming
- Realisability of choreographies
- Applied Choreographies
- Automated synthesis of application-layer connectors from automata-based specifications
This page was built for publication: Deciding choreography realizability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942872)