English
Related papers

Related papers: Refinement for Transition Systems with Responses

200 papers

Modal Transition Systems (MTS) are a well-known formalism that extend Labelled Transition Systems (LTS) with the possibility of specifying necessary and permitted behaviour. Modal refinement ($\preceq_m$) of MTS represents a step of the…

Formal Languages and Automata Theory · Computer Science 2024-03-08 Davide Basile

The Refinement Calculus of Reactive Systems (RCRS) is a compositional formal framework for modeling and reasoning about reactive systems. RCRS provides a language which allows to describe atomic components as symbolic transition systems or…

Logic in Computer Science · Computer Science 2018-02-09 Viorel Preoteasa , Iulia Dragomir , Stavros Tripakis

One central issue in the formal design and analysis of reactive systems is the notion of refinement that asks whether all behaviors of the implementation is allowed by the specification. The local interpretation of behavior leads to the…

Logic in Computer Science · Computer Science 2012-06-22 Krishnendu Chatterjee , Siddhesh Chaubal , Pritish Kamath

Refinement calculus is a powerful and expressive tool for reasoning about sequential programs in a compositional manner. In this paper we present an extension of refinement calculus for reactive systems. Refinement calculus is based on…

Software Engineering · Computer Science 2014-06-24 Viorel Preoteasa , Stavros Tripakis

We consider the extensions of modal transition systems (MTS), namely Boolean MTS and parametric MTS and we investigate the refinement problems over both classes. Firstly, we reduce the problem of modal refinement over both classes to a…

Logic in Computer Science · Computer Science 2013-04-22 Jan Křetínský , Salomon Sickert

Multiparty message-passing protocols are notoriously difficult to design, due to interaction mismatches that lead to errors such as deadlocks. Existing protocol specification formats have been developed to prevent such errors (e.g.…

Programming Languages · Computer Science 2024-08-12 Vassor Martin , Yoshida Nobuko

The analysis of industrial processes, modelled as descriptor systems, is often computationally hard due to the presence of both algebraic couplings and difference equations of high order. In this paper, we introduce a control refinement…

Systems and Control · Computer Science 2017-04-07 Fei Chen , Sofie Haesaert , Alessandro Abate , Siep Weiland

Conditional term rewriting is an intuitive yet complex extension of term rewriting. In order to benefit from the simpler framework of unconditional rewriting, transformations have been defined to eliminate the conditions of conditional term…

Logic in Computer Science · Computer Science 2017-01-04 Karl Gmeiner

Reactive synthesis algorithms allow automatic construction of policies to control an environment modeled as a Markov Decision Process (MDP) that are optimal with respect to high-level temporal logic specifications. However, they assume that…

Formal Languages and Automata Theory · Computer Science 2022-05-31 Rajeev Alur , Suguman Bansal , Osbert Bastani , Kishor Jothimurugan

Iterative abstraction refinement techniques are one of the most prominent paradigms for the analysis and verification of systems with large or infinite state spaces. This paper investigates the changes of truth values of system properties…

Logic in Computer Science · Computer Science 2026-01-14 Jakob Piribauer , Vinzent Zschuppe

Specification theories as a tool in model-driven development processes of component-based software systems have recently attracted a considerable attention. Current specification theories are however qualitative in nature, and therefore…

Logic in Computer Science · Computer Science 2012-10-23 Sebastian S. Bauer , Uli Fahrenberg , Line Juhl , Kim G. Larsen , Axel Legay , Claus Thrane

The majority of modern systems exhibit sophisticated concurrent behaviour, where several system components modify and observe the system state with fine-grained atomicity. Many systems (e.g., multi-core processors, real-time controllers)…

Logic in Computer Science · Computer Science 2013-05-28 Brijesh Dongol , John Derrick

This paper studies the relationships between three notions of behavioural preorder that have been proposed in the literature: refinement over modal transition systems, and the covariant-contravariant simulation and the partial bisimulation…

Logic in Computer Science · Computer Science 2024-02-07 Luca Aceto , Ignacio Fábregas , David de Frutos Escrig , Anna Ingólfsdóttir , Miguel Palomino

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

We introduce skipping refinement, a new notion of correctness for reasoning about optimized reactive systems. Reasoning about reactive systems using refinement involves defining an abstract, high-level specification system and a concrete,…

Logic in Computer Science · Computer Science 2015-02-11 Mitesh Jain , Panagiotis Manolios

We consider the problem of shaping the transient step response of nonlinear systems to satisfy a class of integral constraints. Such constraints are inherent in hybrid energy systems consisting of energy sources and storage elements. While…

Systems and Control · Electrical Eng. & Systems 2020-12-24 Farzad Aalipour , Tuhin Das

Many complex systems satisfy a set of constraints on their degrees of freedom, and at the same time, they are able to work and adapt to different conditions. Here, we describe the emergence of this ability in a simplified model in which the…

Disordered Systems and Neural Networks · Physics 2007-05-23 Ginestra Bianconi , Roberto Mulet

Technology advances give us the hope of driving without human error, reducing vehicle emissions and simplifying an everyday task with the future of self-driving cars. Making sure these vehicles are safe is very important to the continuation…

Logic in Computer Science · Computer Science 2023-05-16 Megan Strauss , Stefan Mitsch

Identifying transition states (TSs), the high-energy configurations that molecules pass through during chemical reactions, is essential for understanding and designing chemical processes. However, accurately and efficiently identifying…

Chemical Physics · Physics 2025-07-23 Samir Darouich , Vinh Tong , Tanja Bien , Johannes Kästner , Mathias Niepert

Reaction Systems (RSs) are a successful computational framework inspired by biological systems. A RS pairs a set of entities with a set of reactions over them. Entities can be used to enable or inhibit each reaction, and are produced by…

Logic in Computer Science · Computer Science 2020-09-01 Linda Brodo , Roberto Bruni , Moreno Falaschi
‹ Prev 1 2 3 10 Next ›