English
Related papers

Related papers: Indefinite waitings in MIRELA systems

200 papers

PROMELA (Process Meta Language) is a high-level specification language designed for modeling interactions in distributed systems. PROMELA is used as the input language for the model checker SPIN (Simple Promela INterpreter). The main…

Programming Languages · Computer Science 2021-08-30 Marco Comini , María del Mar Gallardo , Alicia Villanueva

Timed Automata (TA) is de facto a standard modelling formalism to represent systems when the interest is the analysis of their behaviour as time progresses. This modelling formalism is mostly used for checking whether the behaviours of a…

Logic in Computer Science · Computer Science 2019-09-11 Claudio Menghi , Marcello Bersani , Matteo Rossi , Pierluigi San Pietro

Model checking for real-timed systems is a rich and diverse topic. Among the different logics considered, Metric Interval Temporal Logic (MITL) is a powerful and commonly used logic, which can succinctly encode many interesting timed…

Formal Languages and Automata Theory · Computer Science 2026-05-19 S. Akshay , Prerak Contractor , Paul Gastin , R. Govind , B. Srivathsan

Timed B\"uchi automata provide a very expressive formalism for expressing requirements of real-time systems. Online monitoring and active testing of embedded real-time systems can then be achieved by symbolic execution of such automata on…

Formal Languages and Automata Theory · Computer Science 2025-07-30 Martin Fränzle , Thomas M. Grosen , Kim G. Larsen , Martin Zimmermann

Timed automata (TAs) are a common formalism for modeling timed systems. Bounded model checking (BMC) is a verification method that searches for runs violating a property using a SAT or SMT solver. MITL is a real-time extension of the linear…

Logic in Computer Science · Computer Science 2013-04-29 Roland Kindermann , Tommi Junttila , Ilkka Niemelä

Metric Interval Temporal Logic (MITL) is a well studied real-time, temporal logic that has decidable satisfiability and model checking problems. The decision procedures for MITL rely on the automata theoretic approach, where logic formulas…

Logic in Computer Science · Computer Science 2019-10-11 Nima Roohi , Mahesh Viswanathan

We present a monitoring approach for verifying systems at runtime. Our approach targets systems whose components communicate with the monitors over unreliable channels, where messages can be delayed or lost. In contrast to prior works,…

Logic in Computer Science · Computer Science 2017-07-19 David Basin , Felix Klaedtke , Eugen Zălinescu

Since the topic emerged several years ago, work on regular model checking has mostly been devoted to the verification of state reachability and safety properties. Though it was known that linear temporal properties could also be checked…

Logic in Computer Science · Computer Science 2009-01-27 Ahmed Bouajjani , Axel Legay , Pierre Wolper

Verification of temporal logic properties plays a crucial role in proving the desired behaviors of hybrid systems. In this paper, we propose an interval method for verifying the properties described by a bounded linear temporal logic. We…

Logic in Computer Science · Computer Science 2015-07-15 Daisuke Ishii , Naoki Yonezaki , Alexandre Goldsztejn

The imposition of real-time constraints on a parallel computing environment- specifically high-performance, cluster-computing systems- introduces a variety of challenges with respect to the formal verification of the system's timing…

Logic in Computer Science · Computer Science 2013-01-03 Peter Hui , Satish Chikkagoudar

In this paper we study monitoring of real-time systems with respect to properties expressed either in Metric Interval Temporal Logic or as Timed B\"uchi Automata. We offer efficient symbolic online monitoring algorithms in a number of…

Formal Languages and Automata Theory · Computer Science 2025-09-30 Thomas Møller Grosen , Sean Kauffman , Kim Guldstrand Larsen , Martin Zimmermann

The case study analyzed in the report involves the behavioral specification and verification of a three-stage pipeline consisting of mutually concurrent modules which also compete for a shared resource. The system components are specified…

Software Engineering · Computer Science 2017-05-16 Jerzy Mieścicki , Bogdan Czejdo , Wiktor B. Daszczuk

Timed automata are a common formalism for the verification of concurrent systems subject to timing constraints. They extend finite-state automata with clocks, that constrain the system behavior in locations, and to take transitions. While…

Cryptography and Security · Computer Science 2022-06-08 Johan Arcile , Étienne André

We give a real-time semantics for the concurrent, object-oriented modeling language Creol, by mapping Creol processes to a network of timed automata. We can use our semantics to verify real time properties of Creol objects, in particular to…

Logic in Computer Science · Computer Science 2010-07-30 Mohammad Mahdi Jaghoori , Tom Chothia

This paper introduces the Mimosa language, a programming language for the design and implementation of asynchronous reactive systems, describing them as a collection of time-triggered processes which communicate through FIFO buffers.…

Programming Languages · Computer Science 2025-06-25 Nikolaus Huber , Susanne Graf , Philipp Rümmer , Wang Yi

In this paper, we present a mechanism for building hybrid system observers to differentiate between specific positions of the hybrid system. The mechanism is designed through inferring metric temporal logic (MTL) formulae from simulated…

Systems and Control · Electrical Eng. & Systems 2020-04-07 Zhe Xu , Yi Deng , Agung Julius

Monitoring of hybrid systems attracts both scientific and practical attention. However, monitoring algorithms suffer from the methodological difficulty of only observing sampled discrete-time signals, while real behaviors are…

Systems and Control · Electrical Eng. & Systems 2024-07-26 Masaki Waga , Étienne André , Ichiro Hasuo

We consider temporal logic verification of (possibly nonlinear) dynamical systems evolving over continuous state spaces. Our approach combines automata-based verification and the use of so-called barrier certificates. Automata-based…

Formal Languages and Automata Theory · Computer Science 2014-03-17 Tichakorn Wongpiromsarn , Ufuk Topcu , Andrew Lamperski

Max-Plus Linear (MPL) systems are an algebraic formalism with practical applications in transportation networks, manufacturing and biological systems. In this paper, we investigate the problem of automatically analyzing the properties of…

Formal Languages and Automata Theory · Computer Science 2023-08-22 Muhammad Syifa'ul Mufid , Andrea Micheli , Alessandro Abate , Alessandro Cimatti

The model-checking problem for hybrid systems is a well known challenge in the scientific community. Most of the existing approaches and tools are limited to safety properties only, or operates by transforming the hybrid system to be…

Logic in Computer Science · Computer Science 2013-08-27 Davide Bresolin
‹ Prev 1 2 3 10 Next ›