Results 81 to 90 of about 93,973 (331)

Complexity of ITL model checking: some well-behaved fragments of the interval logic HS

, 2015
Model checking has been successfully used in many computer science fields, including artificial intelligence, theoretical computer science, and databases.
Molinari, A., Montanari, A., Peron, A.
core   +1 more source

Light‐Programmable Interfaces: From Molecular Photoswitching to Adaptive Membrane Separations

Advanced Materials Interfaces, EarlyView.
This review advances an interface‐centered framework for light‐responsive membranes, linking molecular photoswitches (azobenzene (AZO), spiropyran (SP), diarylethene (DAE), donor–acceptor Stenhouse adducts (DASA), photoacid) to integration strategies in polymeric, porous, self‐assembled, and mixed‐matrix systems.
Liangliang Zhang, Senlin Gu, Jianyang Zhao, Xiaojuan Hao, Lu Hua Li, Jihua Li, Lingxue Kong   +6 more
wiley   +1 more source

Partial cut elimination for combinations of propositional multi-modal logics with past time

Lietuvos Matematikos Rinkinys, 2011
We consider combinations of nine propositional multi-modal logics with propositional discrete linear time temporal logic with past time. For these combinations, we present sound and complete Gentzen-type sequent calculi with a restricted cut rule.
Jūratė Sakalauskaitė
doaj   +1 more source

Transducers Across Scales and Frequencies: A System‐Level Framework for Multiphysics Integration and Co‐Design

Advanced Materials Technologies, EarlyView.
Transducers convert physical signals into electrical and optical representations, yet each mechanism is bounded by intrinsic trade‐offs across bandwidth, sensitivity, speed, and energy. This review maps transduction mechanisms across physical scale and frequency, showing how heterogeneous integration and multiphysics co‐design transform isolated ...
Aolei Xu, Mengyao Xiao, Zhouli Sui, Yinpeng Wang, Daoye Zheng, Yuxin Liu, Luwei Wang, Huajun Liu, Chengkuo Lee   +8 more
wiley   +1 more source

Peer Review #3 of "A learning-based synthesis approach of reward asynchronous probabilistic games against the linear temporal logic winning condition (v0.1)"

, 2022

openalex   +1 more source

A Theory of Sampling for Continuous-time Metric Temporal Logic

, 2009
This paper revisits the classical notion of sampling in the setting of real-time temporal logics for the modeling and analysis of systems. The relationship between the satisfiability of Metric Temporal Logic (MTL) formulas over continuous-time models and
Asarin E., Beyer D., Bouajjani A., Bozga M., Bošnački D., Carlo A. Furia, Chakravorty G., Cimatti A., Clarke E. M., Comon H., de Alfaro L., Etessami K., Fainekos G. E., Furia C. A., Graham R. L., Göllü A., Henzinger T. A., Hung D. V., Koymans R., Maler O., Matteo Rossi, Ouaknine J., Pandya P. K., Perrin D., Pradella M.   +24 more
core   +3 more sources

Prompt Interval Temporal Logic [PDF]

, 2016
Interval temporal logics are expressive formalisms for temporal representation and reasoning, which use time intervals as primitive temporal entities. They have been extensively studied for the past two decades and successfully applied in AI and computer science.
Della Monica, Dario, MONTANARI, Angelo, Murano, Aniello, Sala, Pietro   +3 more
openaire   +2 more sources

Recent Advances of Slip Sensors for Smart Robotics

Advanced Materials Technologies, EarlyView.
This review summarizes recent progress in robotic slip sensors across mechanical, electrical, thermal, optical, magnetic, and acoustic mechanisms, offering a comprehensive reference for the selection of slip sensors in robotic applications. In addition, current challenges and emerging trends are identified to advance the development of robust, adaptive,
Xingyu Zhang, Liao Wu, Shuai He, Zhao Sha, Yuwan Huang, Shuying Wu, Dewei Chu, Chun H. Wang, Shuhua Peng   +8 more
wiley   +1 more source

Model-checking branching-time properties of probabilistic automata and probabilistic one-counter automata

, 2015
This paper studies the problem of model-checking of probabilistic automaton and probabilistic one-counter automata against probabilistic branching-time temporal logics (PCTL and PCTL$^*$). We show that it is undecidable for these problems.
Lin, T.
core  

Begin, After, and Later: a Maximal Decidable Interval Temporal Logic

, 2010
Interval temporal logics (ITLs) are logics for reasoning about temporal statements expressed over intervals, i.e., periods of time. The most famous ITL studied so far is Halpern and Shoham's HS, which is the logic of the thirteen Allen's interval ...
A. Montanari, A. Montanari, A. Montanari, Angelo Montanari, D. Bresolin, D. Bresolin, Davide Bresolin, Guido Sciavicco, J.F. Allen, J.Y. Halpern, Margherita Napoli, Mimmo Parente, P. Van Emde Boas, Pietro Sala, V. Goranko, V. Goranko   +15 more
core   +2 more sources