Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of theoretical computer science (vol. B)
Memory-efficient algorithms for the verification of temporal properties
Formal Methods in System Design - Special issue on computer-aided verification: general methods
Generalized fair reachability analysis for cyclic protocols
IEEE/ACM Transactions on Networking (TON)
Verifying identical communicating processes is undecidable
Theoretical Computer Science
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Using I/O automata for developing distributed systems
Foundations of component-based systems
Model-checking of correctness conditions for concurrent objects
Information and Computation - Special issue: LICS 1996—Part 1
Communicating sequential processes
Communications of the ACM
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Conversation Support for Business Process Integration
EDOC '02 Proceedings of the 6th International Enterprise Distributed Object Computing Conference
Realizable and Unrealizable Specifications of Reactive Systems
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
On the Synthesis of an Asynchronous Reactive Module
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
E-services: a look behind the curtain
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Conversation specification: a new approach to design and analysis of e-service composition
WWW '03 Proceedings of the 12th international conference on World Wide Web
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
ESOP'03 Proceedings of the 12th European conference on Programming
Synchronizability of Conversations among Web Services
IEEE Transactions on Software Engineering
Analyzing Conversations of Web Services
IEEE Internet Computing
Verification of communicating data-driven web services
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Complexity and composition of synthesized web services
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Verifying Agent Conformance with Protocols Specified in a Temporal Action Logic
AI*IA '07 Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing
Service Choreography and Orchestration with Conversations
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Correct Channel Passing by Construction
ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
Non-desynchronizable Service Choreographies
ICSOC '08 Proceedings of the 6th International Conference on Service-Oriented Computing
Contract Compliance and Choreography Conformance in the Presence of Message Queues
Web Services and Formal Methods
Formal Modeling and Conformance Validation for WS-CDL using Reo and CASM
Electronic Notes in Theoretical Computer Science (ENTCS)
Analyzing singularity channel contracts
Proceedings of the eighteenth international symposium on Software testing and analysis
Verifying Agents' Conformance with Multiparty Protocols
Computational Logic in Multi-Agent Systems
A modular action description language for protocol composition
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Representing and reasoning about commitments in business processes
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
A lower bound on web services composition
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Interoperation in protocol enactment
DALT'07 Proceedings of the 5th international conference on Declarative agent languages and technologies V
Local enforceability in interaction Petri nets
BPM'07 Proceedings of the 5th international conference on Business process management
On the aggregation problem for synthesized web services
Proceedings of the 13th International Conference on Database Theory
Realizability is controllability
WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
How to implement a theory of correctness in the area of business processes and services
BPM'10 Proceedings of the 8th international conference on Business process management
Realizability analysis for message-based interactions using shared-state projections
Proceedings of the eighteenth ACM SIGSOFT international symposium on Foundations of software engineering
Interaction-centric modeling of process choreographies
Information Systems
Temporal specifications for services with unboundedly many passive clients
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Choreography conformance via synchronizability
Proceedings of the 20th international conference on World wide web
Interface decomposition for service compositions
Proceedings of the 33rd International Conference on Software Engineering
An interface theory for service-oriented design
FASE'11/ETAPS'11 Proceedings of the 14th international conference on Fundamental approaches to software engineering: part of the joint European conferences on theory and practice of software
Deciding choreography realizability
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Analysis of realizability conditions for web service choreographies
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Decidability results for choreography realization
ICSOC'11 Proceedings of the 9th international conference on Service-Oriented Computing
Structured Communication-Centered Programming for Web Services
ACM Transactions on Programming Languages and Systems (TOPLAS)
Checking the realizability of BPMN 2.0 choreographies
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Consistency of service composition
FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
Counterexample guided synthesis of monitors for realizability enforcement
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Declarative choreographies for artifacts
ICSOC'12 Proceedings of the 10th international conference on Service-Oriented Computing
On the aggregation problem for synthesized Web services
Journal of Computer and System Sciences
Using motivation and choreography to model distributed workflow
Proceedings of the 5th ACM SIGCHI Annual International Workshop on Behaviour Modelling - Foundations and Applications
An interface theory for service-oriented design
Theoretical Computer Science
Algorithms for checking channel passing in web service choreography
Frontiers of Computer Science: Selected Publications from Chinese Universities
Hi-index | 0.00 |
This paper focuses on the realizability problem of a framework for modeling and specifying the global behaviors of reactive electronic services (e-services). In this framework, Web accessible programs (peers) communicate by asynchronous message passing, and a virtual global watcher silently listens to the network. The global behavior is characterized by a "conversation", which is the infinite sequence of messages observed by the watcher. We show that given a Büchi automaton specifying the desired set of conversations, called a "conversation protocol", it is possible to realize the protocol using a set of finite state peers if three realizability conditions are satisfied. In particular, the synthesized peers will conform to the protocol by generating only those conversations specified by the protocol. Our results enable a top-down verification strategy where (1) A conversation protocol is specified by a realizable Büchi automaton, (2) The properties of the protocol are verified on the Büchi automaton specification, and (3) The peer implementations are synthesized from the protocol via projection.