Controller/Orchestrator Synthesis via Filtration

The present paper is interested in the following decision problems: (1) given finite frames F, F^', determine if there exists a frame F^'' such that F and F^'@?F^'', the synchronous product of F^' and F^'', are bisimilar; (2) given finite frames F, F^', determine if there exists a frame F^'' such that F and F^'@?F^'', the asynchronous product of F^' and F^'', are bisimilar. It shows that variants of the filtration method are adequate for solving them.

[1]  Joseph Sifakis,et al.  On the Synthesis of Discrete Controllers for Timed Systems (An Extended Abstract) , 1995, STACS.

[2]  John N. Tsitsiklis,et al.  On the control of discrete-event dynamical systems , 1987, 26th IEEE Conference on Decision and Control.

[3]  Setsuo Ohsuga,et al.  INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES , 1977 .

[4]  W. M. Wonham,et al.  The control of discrete event systems , 1989 .

[5]  Diego Calvanese,et al.  Automatic Composition of Transition-based Semantic Web Services with Messaging , 2005, VLDB.

[6]  Annapaola Marconi,et al.  Automated Composition of Web Services by Planning at the Knowledge Level , 2005, IJCAI.

[7]  Diego Calvanese,et al.  Automatic Composition of E-services That Export Their Behavior , 2003, ICSOC.

[8]  Yde Venema,et al.  Dynamic Logic by David Harel, Dexter Kozen and Jerzy Tiuryn. The MIT Press, Cambridge, Massachusetts. Hardback: ISBN 0–262–08289–6, $50, xv + 459 pages , 2002, Theory and Practice of Logic Programming.

[9]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[10]  Igor Walukiewicz,et al.  Games for synthesis of controllers with partial observation , 2003, Theor. Comput. Sci..

[11]  Igor Walukiewicz,et al.  Foundations of Software Science and Computation Structures , 2004, Lecture Notes in Computer Science.

[12]  Ewa Orlowska,et al.  Service-Oriented Computing - ICSOC 2003 , 2003, Lecture Notes in Computer Science.

[13]  Jerzy Tiuryn,et al.  Dynamic logic , 2001, SIGA.

[14]  Anca Muscholl,et al.  A Lower Bound on Web Services Composition , 2008, Log. Methods Comput. Sci..

[15]  José L. Balcázar,et al.  Parallel Complexity in the Design and Analysis on Conurrent Systems , 1991, PARLE.

[16]  Helmut Veith,et al.  Counterexample-guided abstraction refinement for symbolic model checking , 2003, JACM.

[17]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[18]  Jan van Leeuwen,et al.  Parle ’91 Parallel Architectures and Languages Europe , 1991, Lecture Notes in Computer Science.

[19]  A. Arnold,et al.  Rudiments of μ-calculus , 2001 .

[20]  R. BurchJ.,et al.  Symbolic model checking , 1992 .

[21]  Diego Calvanese,et al.  Synthesis of underspecified composite e-services based on automated reasoning , 2004, ICSOC '04.