Results 11 to 20 of about 6,025 (211)
Bisimulation of automata [PDF]
Information and Computation, 1988 The authors give an algebraic characterization of automata and discuss various types of simulation between them. Their environment is the category PureAut whose objects are so-called incompletely-specified nondeterministic input-only automata with a set of pure states, and whose morphisms are given by certain maps between the sets of pure states.
David B. Benson, Ofer Ben-Shachar
openaire +4 more sources
Symbolic semantics and bisimulation for full LOTOS [PDF]
, 2000 No abstract ...
Calder, M. +5 more
core +9 more sources
INQUISITIVE BISIMULATION [PDF]
The Journal of Symbolic Logic, 2020 AbstractInquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are interested in. Technically, InqML fits within the family of logics based on team semantics.
Ciardelli I, Otto M
openaire +4 more sources
Linearity and Bisimulation [PDF]
The Journal of Logic and Algebraic Programming, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nobuko Yoshida +2 more
openaire +1 more source
Decentralized modular hybrid supervisory control for the formation of unmanned helicopters
IET Control Theory &Applications, Volume 17, Issue 2, Page 210-222, January 2023., 2023 Abstract Formation control of Unmanned Aerial Vehicles (UAVs) requires them to tightly cooperate to reach and keep the formation, while avoiding collision. This paper proposes a novel decentralized hybrid supervisory control approach for the formation control of multiple UAVs.
Ali Karimoddini +2 more
wiley +1 more source
A survey of knowledge‐based sequential decision‐making under uncertainty
AI Magazine, Volume 43, Issue 2, Page 249-266, Summer 2022., 2022 Abstract Reasoning with declarative knowledge (RDK) and sequential decision‐making (SDM) are two key research areas in artificial intelligence. RDK methods reason with declarative domain knowledge, including commonsense knowledge, that is either provided a priori or acquired over time, while SDM methods (probabilistic planning [PP] and reinforcement ...
Shiqi Zhang, Mohan Sridharan
wiley +1 more source
Wireless Communications and Mobile Computing, Volume 2022, Issue 1, 2022., 2022 It was to explore the accuracy of intelligent home medical system based on Internet of Things (IoT) technology and its application value in home care of senile dementia patients. Based on IoT, 5th generation wireless systems (5G), and smart wearable technology, intelligent home medical system was designed from the perspectives of system environment and
Qiong Wang, Haibin Lv
wiley +1 more source
Mathematical Problems in Engineering, Volume 2022, Issue 1, 2022., 2022 In an open environment, the demands of users are diverse and dynamic because users can participate in product design from beginning to end. Owing to this, the disorderly and unplanned participation of users will greatly increase the complexity of multi‐attribute decision‐making (MADM) in the product design process.
Haihua Zhu +4 more
wiley +1 more source
Distributed bisimulations [PDF]
Journal of the ACM, 1989 A new equivalence between concurrent processes is proposed. It generalizes the well-known bisimulation equivalence to take into account the distributed nature of processes. The result is a noninterleaving semantic theory; concurrent processes are differentiated from processes that are non-deterministic but sequential. The new equivalence, together with
Ilaria Castellani, Matthew Hennessy
openaire +2 more sources
Modelling and verification of parameterized architectures: A functional approach
IET Computers &Digital Techniques, Volume 15, Issue 5, Page 335-348, September 2021., 2021 Abstract The merit of higher order functions for hardware description and transformation is widely acknowledged by hardware designers. However, the use of higher order types makes their correctness proof very difficult. Herein, a new proof approach based on the principle of partial application is proposed which transforms higher order functions into ...
Salah Merniz, Saad Harous
wiley +1 more source