scholarly journals Verification of Parameterized Communicating Automata via Split-Width

2016 ◽  
pp. 197-213
Author(s):  
Marie Fortin ◽  
Paul Gastin
Keyword(s):  
Communicating Automata

Parallel communicating automata systems — A survey

2000 ◽  
Vol 7 (2) ◽  
Author(s):  
Carlos Martín-Vide ◽  
Victor Mitrana
Keyword(s):  
Communicating Automata

scholarly journals A Kleene theorem and model checking algorithms for existentially bounded communicating automata

2006 ◽  
Vol 204 (6) ◽  
pp. 920-956 ◽  
Author(s):  
Blaise Genest ◽  
Dietrich Kuske ◽  
Anca Muscholl
Keyword(s):  
Model Checking ◽  
Communicating Automata ◽  
Kleene Theorem

scholarly journals Diagnosis of Deep Discrete-Event Systems

2020 ◽  
Vol 69 ◽  
pp. 1473-1532
Author(s):  
Gianfranco Lamperti ◽  
Marina Zanella ◽  
Xiangfu Zhao
Keyword(s):  
Computational Complexity ◽  
Regular Language ◽  
Discrete Event Systems ◽  
Discrete Event ◽  
Communicating Automata ◽  
Event Systems ◽  
Hierarchical Complexity ◽  
Interaction Of Components ◽  
Abstraction Levels ◽  
Diagnosis Technique

An abduction-based diagnosis technique for a class of discrete-event systems (DESs), called deep DESs (DDESs), is presented. A DDES has a tree structure, where each node is a network of communicating automata, called an active unit (AU). The interaction of components within an AU gives rise to emergent events. An emergent event occurs when specific components collectively perform a sequence of transitions matching a given regular language. Any event emerging in an AU triggers the transition of a component in its parent AU. We say that the DDES has a deep behavior, in the sense that the behavior of an AU is governed not only by the events exchanged by the components within the AU but also by the events emerging from child AUs. Deep behavior characterizes not only living beings, including humans, but also artifacts, such as robots that operate in contexts at varying abstraction levels. Surprisingly, experimental results indicate that the hierarchical complexity of the system translates into a decreased computational complexity of the diagnosis task. Hence, the diagnosis technique is shown to be (formally) correct as well as (empirically) efficient.

Web Services Composition Problem

2011 ◽  
pp. 175-198
Author(s):  
Fahima Cheikh
Keyword(s):  
Web Services ◽  
Access Control ◽  
Control Constraints ◽  
Web Services Composition ◽  
Services Composition ◽  
Communicating Automata ◽  
Complexity Results ◽  
Composition Problem ◽  
Client Request ◽  
Detailed Presentation

In the approach taken in this chapter, the composition problem is as follows: given a client service, a goal service and a set of available services, determine if there exists a mediator service that enables the communication between the client and the existing services in order to satisfy the client request, represented by the goal service. In this chapter’s model, available services that have access control constraints are considered. To formally capture these constraints, the chapter defines Web Services as Conditional Communicating Automata (CCA) in which communication is done through bounded ports. This chapter gives a detailed presentation of said model and gives complexity results of the composition problem.

Web Services Composition Problem

2013 ◽  
pp. 1400-1424
Author(s):  
Fahima Cheikh
Keyword(s):  
Web Services ◽  
Access Control ◽  
Control Constraints ◽  
Web Services Composition ◽  
Services Composition ◽  
Communicating Automata ◽  
Complexity Results ◽  
Composition Problem ◽  
Client Request ◽  
Detailed Presentation

In the approach taken in this chapter, the composition problem is as follows: given a client service, a goal service and a set of available services, determine if there exists a mediator service that enables the communication between the client and the existing services in order to satisfy the client request, represented by the goal service. In this chapter’s model, available services that have access control constraints are considered. To formally capture these constraints, the chapter defines Web Services as Conditional Communicating Automata (CCA) in which communication is done through bounded ports. This chapter gives a detailed presentation of said model and gives complexity results of the composition problem.

Communicating automata

2021 ◽  
pp. 1147-1188
Author(s):  
Dietrich Kuske ◽  
Anca Muscholl
Keyword(s):  
Communicating Automata

Analysing neurobiological models using communicating automata

2014 ◽  
Vol 26 (6) ◽  
pp. 1169-1204 ◽  
Author(s):  
Li Su ◽  
Rodolfo Gomez ◽  
Howard Bowman
Keyword(s):  
Communicating Automata
Sign in / Sign up

Export Citation Format

Share Document