English
Related papers

Related papers: Hybrid Rebeca Revisited

200 papers

We propose an extension of the zone-based algorithmics for analyzing timed automata to handle systems where timing uncertainty is considered as probabilistic rather than set-theoretic. We study duration probabilistic automata (DPA),…

Formal Languages and Automata Theory · Computer Science 2010-11-02 Oded Maler , Kim G. Larsen , Bruce H. Krogh

Timed automata are a convenient mathematical model for modelling and reasoning about real-time systems. While they provide a powerful way of representing timing aspects of such systems, timed automata assume arbitrary precision and…

Formal Languages and Automata Theory · Computer Science 2020-07-09 Emily Clement , Thierry Jéron , Nicolas Markey , David Mentré

The success of smart environments largely depends on their smartness of understanding the environments' ongoing situations. Accordingly, this task is an essence to smart environment central processors. Obtaining knowledge from the…

Human-Computer Interaction · Computer Science 2019-06-25 Hossein Rajaby Faghihi , Mohammad Amin Fazli , Jafar Habibi

We introduce a technique for reachability analysis of Time-Basic (TB) Petri nets, a powerful formalism for real- time systems where time constraints are expressed as intervals, representing possible transition firing times, whose bounds are…

Software Engineering · Computer Science 2011-07-07 Carlo Bellettini , Lorenzo Capra

In [ABM07], Abdulla et al. introduced the concept of decisiveness, an interesting tool for lifting good properties of finite Markov chains to denumerable ones. Later, this concept was extended to more general stochastic transition systems…

Logic in Computer Science · Computer Science 2022-01-11 Patricia Bouyer , Thomas Brihaye , Mickael Randour , Cédric Rivière , Pierre Vandenhove

Reversible computing is a new paradigm that has emerged recently and extends the traditional forwards-only computing mode with the ability to execute in backwards, so that computation can run in reverse as easily as in forward. Two…

Formal Languages and Automata Theory · Computer Science 2023-09-07 Nataliya Gribovskaya , Irina Virbitskaite

Event-clock automata (ECA) are a well-known semantic subclass of timed automata (TA) which enjoy admirable theoretical properties, e.g., determinizability, and are practically useful to capture timed specifications. However, unlike for…

Formal Languages and Automata Theory · Computer Science 2024-08-07 S Akshay , Paul Gastin , R Govind , B Srivathsan

Hamilton-Jacobi (HJ) reachability analysis has been developed over the past decades into a widely-applicable tool for determining goal satisfaction and safety verification in nonlinear systems. While HJ reachability can be formulated very…

Robotics · Computer Science 2020-03-13 Vicenc Rubies-Royo , David Fridovich-Keil , Sylvia Herbert , Claire J. Tomlin

We study the reachability problem for networks of timed communicating processes. Each process is a timed automaton communicating with other processes by exchanging messages over unbounded FIFO channels. Messages carry clocks which are…

Formal Languages and Automata Theory · Computer Science 2018-04-24 Lorenzo Clemente

Training a model to detect patterns of interrelated events that form situations of interest can be a complex problem: such situations tend to be uncommon, and only sparse data is available. We propose a hybrid neuro-symbolic architecture…

Timed transition systems are behavioural models that include an explicit treatment of time flow and are used to formalise the semantics of several foundational process calculi and automata. Despite their relevance, a general mathematical…

Logic in Computer Science · Computer Science 2023-06-22 Tomasz Brengos , Marco Peressotti

These lecture notes cover basic automata-theoretic concepts and logical formalisms for the modeling and verification of concurrent and distributed systems. Many of these concepts naturally extend the classical automata and logics over…

Logic in Computer Science · Computer Science 2021-10-19 Benedikt Bollig , Paul Gastin

This article aims to provide an accessible, tutorial-style introduction to hybrid extremum-seeking systems, which are model-free, feedback-optimization controllers that incorporate hybrid dynamics, meaning both continuous-time and…

Optimization and Control · Mathematics 2025-12-18 Jorge I. Poveda , Andrew R. Teel

Timed basic parallel processes (TBPP) extend communication-free Petri nets (aka. BPP or commutative context-free grammars) by a global notion of time. TBPP can be seen as an extension of timed automata (TA) with context-free branching…

Formal Languages and Automata Theory · Computer Science 2019-07-09 Lorenzo Clemente , Piotr Hofman , Patrick Totzke

Forward reachability analysis is a dominant approach for verifying reach-avoid specifications in neural feedback systems, i.e., dynamical systems controlled by neural networks, and a number of directions have been proposed and studied. In…

Artificial Intelligence · Computer Science 2026-03-24 Samuel I. Akinwande , Sydney M. Katz , Mykel J. Kochenderfer , Clark Barrett

Real time system technology traditionally developed for safety critical systems, has now been extended to support multimedia systems and virtual reality. A large number of real-time application, related to multimedia and adaptive control…

Operating Systems · Computer Science 2012-12-17 Shri Prakash Dwivedi

Different stochastic extensions of hybrid automata have been proposed in the past, with unclear expressivity relations between them. To structure and relate these modeling languages, in this paper we formalize two alternative approaches to…

Formal Languages and Automata Theory · Computer Science 2023-08-09 Lisa Willemsen , Anne Remke , Erika Ábrahám

In this paper, we propose a computationally efficient framework for interval reachability of systems with neural network controllers. Our approach leverages inclusion functions for the open-loop system and the neural network controller to…

Systems and Control · Electrical Eng. & Systems 2024-06-28 Saber Jafarpour , Akash Harapanahalli , Samuel Coogan

By revisiting the path-integral formulation of the Hubbard model, we propose a theoretical approach based on a semiclassical approximation employing an unconventional coherent-state representation. Within this framework, a subset of the…

Strongly Correlated Electrons · Physics 2026-04-06 Yuki Yamasaki , Hidemaro Suwa , Cristian D. Batista , Shintaro Hoshino

Environmental processes often exhibit complex, non-linear patterns and discontinuities across space and time, posing significant challenges for traditional geostatistical modeling approaches. In this paper, we propose a hybrid…

Methodology · Statistics 2026-05-06 Mario Figueira , Michela Cameletti , Luca Patelli
‹ Prev 1 4 5 6 7 8 10 Next ›