Realizable temporal logics for web service choreography
From MaRDI portal
Publication:739636
DOI10.1016/J.JLAMP.2016.06.002zbMATH Open1348.68148OpenAlexW2460437814MaRDI QIDQ739636FDOQ739636
Authors: D. Kharzeev 
Publication date: 18 August 2016
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2016.06.002
Recommendations
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Internet topics (68M11)
Cites Work
- Deciding choreography realizability
- On Communicating Finite-State Machines
- An expressively complete linear time temporal logic for Mazurkiewicz traces
- Structured Communication-Centred Programming for Web Services
- Realizability and verification of MSC graphs
- Conversation protocols: a formalism for specification and verification of reactive electronic services
- Analysis of Realizability Conditions for Web Service Choreographies
- Formal Models of Communicating Systems
- Reasoning about layered message passing systems
- Title not available (Why is that?)
- Counterexample Guided Synthesis of Monitors for Realizability Enforcement
- Mathematical Foundations of Computer Science 2003
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Cited In (4)
- Conversation protocols: a formalism for specification and verification of reactive electronic services
- Tisa: A Language Design and Modular Verification Technique for Temporal Policies in Web Services
- Conversation protocols: a formalism for specification and verification of reactive electronic services
- Analysis of Realizability Conditions for Web Service Choreographies
This page was built for publication: Realizable temporal logics for web service choreography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q739636)
