Checking the realizability of BPMN 2.0 choreographies
Authors:
Open Access
- 26 March 2012
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1927-1934
Abstract
No abstract availableFunding Information
- Agence Nationale de la Recherche (PIMI-ANR-2010-VERS-0014-03)
This publication has 17 references indexed in Scilit:
- Interaction-centric modeling of process choreographiesInformation Systems, 2011
- Synthesis and Composition of Web Services2009
- Specification of realizable service conversations using collaboration diagramsService Oriented Computing and Applications, 2008
- Adaptation of Service Protocols Using Process Algebra and On-the-Fly Reduction Techniques2008
- Realizability and verification of MSC graphsTheoretical Computer Science, 2005
- Conversation protocols: a formalism for specification and verification of reactive electronic servicesTheoretical Computer Science, 2004
- Incremental elaboration of scenario-based specifications and behavior models using implied scenariosACM Transactions on Software Engineering and Methodology, 2004
- Inference of message sequence chartsIEEE Transactions on Software Engineering, 2003
- Efficient on-the-fly model-checking for regular alternation-free mu-calculusScience of Computer Programming, 2003
- On Communicating Finite-State MachinesJournal of the ACM, 1983