English
Related papers

Related papers: Real-Time Specification Patterns and Tools

200 papers

Identifying a temporal pattern of events is a fundamental task of on-line (real-time) verification. We present efficient schemes for on-line monitoring of events for identifying desired/undesired patterns of events. The schemes use…

Data Structures and Algorithms · Computer Science 2015-05-28 Shlomi Dolev , Jonathan Goldfeld , Rami Puzis

A challenging problem for autonomous systems is to synthesize a reactive controller that conforms to a set of given correctness properties. Linear temporal logic (LTL) provides a formal language to specify the desired behavioral properties…

Formal Languages and Automata Theory · Computer Science 2019-10-08 Rayna Dimitrova , Mahsa Ghasemi , Ufuk Topcu

Inspired by the pioneering work of Gilles Kahn on concurrent systems, we propose to model timed systems as a network of software components (implemented as real-time processes or tasks), each of which is specified to compute a collection of…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-11-30 Wang Yi , Morteza Mohaqeqi , Susanne Graf

While reachability analysis is one of the most promising approaches for formal verification of dynamic systems, a major disadvantage preventing a more widespread application is the requirement to manually tune algorithm parameters such as…

Logic in Computer Science · Computer Science 2024-04-09 Niklas Kochdumper , Stanley Bak

Many embedded and real-time systems have a inherent probabilistic behaviour (sensors data, unreliable hardware,...). In that context, it is crucial to evaluate system properties such as "the probability that a particular hardware fails".…

Software Engineering · Computer Science 2015-09-22 Van Chan Ngo , Axel Legay , Jean Quilbeuf

Hyperproperties are properties of computational systems that require more than one trace to evaluate, e.g., many information-flow security and concurrency requirements. Where a trace property defines a set of traces, a hyperproperty defines…

Logic in Computer Science · Computer Science 2021-04-30 Jan Baumeister , Norine Coenen , Borzoo Bonakdarpour , Bernd Finkbeiner , Cesar Sanchez

Model-based development enables quicker prototyping, earlier experimentation and validation of design intents. For a multi-agent system with complex asynchronous interactions and concurrency, formal verification, model-checking in…

Robotics · Computer Science 2025-11-20 Hiep Hong Trinh , Marjan Sirjani , Federico Ciccozzi , Abu Naser Masud , Mikael Sjödin

Autonomous systems control many tasks in our daily lives. To increase trust in those systems and safety of the interaction between humans and autonomous systems, the system behaviour and reasons for autonomous decision should be explained…

Software Engineering · Computer Science 2022-09-29 Maike Schwammberger , Verena Klös

This paper introduces a new technique for dynamic verification of component-based real-time systems based on statistical inference. Verifying such systems requires checking two types of properties: functional and real-time. For functional…

Software Engineering · Computer Science 2015-01-13 Chandrakana Nandi , Aurelien Monot , Manuel Oriol

Requirements are informal and semi-formal descriptions of the expected behavior of a system. They are usually expressed in the form of natural language sentences and checked for errors manually, e.g., by peer reviews. Manual checks are…

Logic in Computer Science · Computer Science 2018-04-30 Simone Vuotto

The formalization of process knowledge using ontologies enables consistent modeling of parameter interdependencies in manufacturing. These interdependencies are typically represented as mathematical expressions that define relations between…

Artificial Intelligence · Computer Science 2025-06-23 Tom Jeleniewski , Hamied Nabizada , Jonathan Reif , Felix Gehlhoff , Alexander Fay

We consider the model checking problem of infinite state systems given in the form of parameterized discrete timed networks with multiple clocks. We show that this problem is decidable with respect to specifications given by B- or…

Logic in Computer Science · Computer Science 2016-09-15 Benjamin Aminof , Sasha Rubin , Francesco Spegni , Florian Zuleger

In this paper we present an assume-guarantee specification theory (aka interface theory from [14]) for modular synthesis and verification of real-time systems with critical timing constraints. It is a further step of our earlier work [10]…

Logic in Computer Science · Computer Science 2013-04-30 Chris Chilton , Marta Kwiatkowska , Xu Wang

Large language model agents that use external tools are often implemented through reactive execution, in which reasoning is repeatedly recomputed after each observation, increasing latency and sensitivity to error propagation. This work…

Artificial Intelligence · Computer Science 2026-04-07 Paulo Akira F. Enabe

This paper discusses a model-based approach to validate software requirements in agile development processes by simulation and in particular automated testing. The use of models as central development artifact needs to be added to the…

Software Engineering · Computer Science 2014-09-24 Jewgenij Botaschanjan , Markus Pister , Bernhard Rumpe

In this contribution we revisit regular model checking, a powerful framework that has been successfully applied for the verification of infinite-state systems, especially parameterized systems (concurrent systems with an arbitrary number of…

Logic in Computer Science · Computer Science 2021-11-23 Anthony W. Lin , Philipp Rümmer

Timing aspects in formalisms with explicit resources and parallelism are investigated, and it is presented a formal link between timed membrane systems and timed Petri nets with localities. For both formalisms, timing does not increase the…

Distributed, Parallel, and Cluster Computing · Computer Science 2011-07-07 Bogdan Aman , Gabriel Ciobanu

In the development of safety and mission-critical systems, including autonomous space robotic missions, complex behaviour is captured during the requirements elicitation phase. Requirements are typically expressed using natural language…

Logic in Computer Science · Computer Science 2025-11-19 Mahdi Etumi , Hazel M. Taylor , Marie Farrell

Reachable set computation is an important tool for analyzing control systems. Simulating a control system can show general trends, but a formal tool like reachability analysis can provide guarantees of correctness. Reachability analysis for…

Systems and Control · Electrical Eng. & Systems 2025-05-07 Chelsea Sidrane , Jana Tumova

Tool use, such as web search, has become a standard capability even in freely available large language models (LLMs). However, existing benchmarks evaluate temporal reasoning mainly in static, non-tool-using settings, which poorly reflect…

Computation and Language · Computer Science 2026-03-24 Zhengxiang Wang , Zeyu Dong