Realizable temporal logics for web service choreography
From MaRDI portal
Publication:739636
DOI10.1016/J.JLAMP.2016.06.002zbMath1348.68148OpenAlexW2460437814MaRDI QIDQ739636
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
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Internet topics (68M11)
Cites Work
- Unnamed Item
- Conversation protocols: a formalism for specification and verification of reactive electronic services
- Realizability and verification of MSC graphs
- Reasoning about layered message passing systems
- An expressively complete linear time temporal logic for Mazurkiewicz traces
- Deciding choreography realizability
- Analysis of Realizability Conditions for Web Service Choreographies
- On Communicating Finite-State Machines
- Counterexample Guided Synthesis of Monitors for Realizability Enforcement
- Formal Models of Communicating Systems
- Mathematical Foundations of Computer Science 2003
- Structured Communication-Centred Programming for Web Services
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
This page was built for publication: Realizable temporal logics for web service choreography
