6 research outputs found
A Semantic Model for Interacting Cyber-Physical Systems
We propose a component-based semantic model for Cyber-Physical Systems (CPSs)
wherein the notion of a component abstracts the internal details of both cyber
and physical processes, to expose a uniform semantic model of their externally
observable behaviors expressed as sets of sequences of observations. We
introduce algebraic operations on such sequences to model different kinds of
component composition. These composition operators yield the externally
observable behavior of their resulting composite components through
specifications of interactions of the behaviors of their constituent
components, as they, e.g., synchronize with or mutually exclude each other's
alternative behaviors. Our framework is expressive enough to allow articulation
of properties that coordinate desired interactions among composed components
within the framework, also as component behavior. We demonstrate the usefulness
of our formalism through examples of coordination properties in a CPS
consisting of two robots interacting through shared physical resources
Application of Regular Grammar in the Syntactic Analysis of Email Addresses
Context: This article proposes the use of regular grammar as a strategy to validate the textual structures of emails. It focuses on the RFC 5321 standard and its syntax, formalizing regular grammars to apply production rules with the aim of validating the syntactic context of each structure of an email address.
Method: This article presents a literature review and the development of an email validation model. Related texts focus on the Internet Protocol, along with building automata that apply IPV4 protocol. There are three phases: the development of the model from syntax and regular grammar rules and its construction and application.
Results: The result is a functional application that validates email addresses based on regular grammars and existing regulations. When running efficiency tests, our application obtained a higher email validation margin in comparison with JFLAP. The library can work as a great analyzer of grammatical or lexical structures.
Conclusions: The email validation tool based on GR regular grammars contributes to the practical use of specialized algorithms in the field of computer science, since it is possible to apply it to the recognition of search patterns such as the analysis of lexical structures (e.g., NITs, alphanumeric codes, and valid URLs)
Soft constraint automata with memory
We revise soft constraint automata, wherein transitions are weighted and each action has an associated preference value. We first relax the underlying algebraic structure to allow bipolar preferences. We then equip automata with memory locations, that is, with an internal state to remember and update information from transition to transition. We furthermore revise automata operators, such as composition and hiding, providing examples on how such memory locations interact with preferences. We finally apply our framework to encode context-sensitive behaviour
Soft constraint automata with memory
We revise soft constraint automata, wherein transitions are weighted and each action has an associated preference value. We first relax the underlying algebraic structure to allow bipolar preferences. We then equip automata with memory locations, that is, with an internal state to remember and update information from transition to transition. We furthermore revise automata operators, such as composition and hiding, providing examples on how such memory locations interact with preferences. We finally apply our framework to encode context-sensitive behaviour
Soft constraint automata with memory
In this paper, we revise the notion of Soft Constraint Automata, where automata transitions are weighted and consequently each action is associated with a preference value. We first relax the underlying algebraic structure that models preferences, with the purpose to use bipolar preferences (i.e., both positive and negative ones). Then, we equip automata with memory cells, that is, with an internal state to remember and update information from transition to transition. Finally, we revise automata operators, as join and hiding
Soft constraint automata with memory
In this paper, we revise the notion of Soft Constraint Automata, where automata transitions are weighted and consequently each action is associated with a preference value. We first relax the underlying algebraic str