English
Related papers

Related papers: Conformance Verification of Normative Specificatio…

200 papers

Conformance checking is a sub-discipline of process mining, which compares observed process traces with a process model to analyze whether the process execution conforms with or deviates from the process design. Organizations can leverage…

Software Engineering · Computer Science 2025-07-17 Jana-Rebecca Rehse , Michael Grohs , Finn Klessascheck , Lisa-Marie Klein , Tatiana von Landesberger , Luise Pufahl

Euler diagrams are a tool for the graphical representation of set relations. Due to their simple way of visualizing elements in the sets by geometric containment, they are easily readable by an inexperienced reader. Euler diagrams where the…

Computational Geometry · Computer Science 2024-06-12 Dominik Dürrschnabel , Uta Priss

Thanks to its graphical notation and simplicity, Unified Modeling Language (UML) is a de facto standard and a widespread language used in both industry and academia, despite the fact that its semantics is still informal. The Interaction…

Software Engineering · Computer Science 2014-01-23 Aymen Louati , Chadlia Jerad , Kamel Barkaoui

Model-Based Anomaly Detection has been a successful approach to identify deviations from the expected behavior of Cyber-Physical Production Systems. Since manual creation of these models is a time-consuming process, it is advantageous to…

Artificial Intelligence · Computer Science 2023-08-28 Tom Westermann , Milapji Singh Gill , Alexander Fay

Business process monitoring approaches have thus far mainly focused on monitoring the execution of a process with respect to a single process model. However, in some cases it is necessary to consider multiple process specifications…

Artificial Intelligence · Computer Science 2021-11-29 Anti Alman , Fabrizio Maria Maggi , Marco Montali , Fabio Patrizi , Andrey Rivkin

While most social norms are informal, they are often formalized by companies in contracts to regulate trades of goods and services. When poorly written, contracts may contain normative conflicts resulting from opposing deontic meanings or…

Computation and Language · Computer Science 2019-06-06 João Paulo Aires , Roger Granada , Juarez Monteiro , Rodrigo C. Barros , Felipe Meneguzzi

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

Signed networks have been a topic of recent interest in the network control community as they allow studying antagonistic interactions in multi-agent systems. Although dynamical characteristics of signed networks have been well-studied,…

Optimization and Control · Mathematics 2017-07-13 Siavash Alemzadeh , Mathias Hudoba de Badyn , Mehran Mesbahi

Monitorability delineates what properties can be verified at runtime. Although many monitorability definitions exist, few are defined explicitly in terms of the guarantees provided by monitors, i.e., the computational entities carrying out…

Logic in Computer Science · Computer Science 2019-06-04 Luca Aceto , Antonis Achilleos , Adrian Francalanza , Anna Ingólfsdóttir , Karoliina Lehtinen

An engineering design process may involve software modules that can executed concurrently. Concurrent modules can be very easily subject to some synchronization errors. This paper discusses verification process for such engineering…

Software Engineering · Computer Science 2017-04-24 Jerzy Mieścicki , Mikołaj Baszun , Wiktor B. Daszczuk , Bogdan D. Czejdo

In our ongoing work, we use constraint automata to compile protocol specifications expressed as Reo connectors into efficient executable code, e.g., in C. We have by now studied this automata based compilation approach rather well, and have…

Programming Languages · Computer Science 2014-10-29 Sung-Shik T. Q. Jongmans , Farhad Arbab

Traditional approaches for smart contract analysis often rely on intermediate representations such as abstract syntax trees, control-flow graphs, or static single assignment form. However, these methods face limitations in capturing both…

Cryptography and Security · Computer Science 2026-04-15 Xiaoqi Li , Hailu Kuang , Wenkai Li , Zongwei Li , Shipeng Ye

We present a new approach to automated reasoning about higher-order programs by extending symbolic execution to use behavioral contracts as symbolic values, enabling symbolic approximation of higher-order behavior. Our approach is based on…

Programming Languages · Computer Science 2012-04-27 Sam Tobin-Hochstadt , David Van Horn

This paper presents the Pi-graphs, a visual paradigm for the modelling and verification of mobile systems. The language is a graphical variant of the Pi-calculus with iterators to express non-terminating behaviors. The operational semantics…

Formal Languages and Automata Theory · Computer Science 2010-11-02 Frédéric Peschanski , Hanna Klaudel , Raymond Devillers

Timed automata are a widely used formalism for specifying the discrete-state/continuous-time behavior of time-critical reactive systems. For the fundamental verification problem of comparing two timed automata, it has been shown that timed…

Formal Languages and Automata Theory · Computer Science 2026-04-01 Alexander Lieb , Hendrik Göttmann , Lars Luthmann , Malte Lochau , Andy Schürr

Autonomous vehicles need to be designed to abide by the same rules that humans follow. This is challenging, because traffic rules are fuzzy and not well defined, making them incomprehensible to machines. Satisfaction cannot be incorporated…

Robotics · Computer Science 2021-02-08 Klemens Esterle , Luis Gressenbuch , Alois Knoll

This paper discusses how model checking, a technique used for the verification of behavioural requirements of dynamic systems, can be usefully deployed for the verification of contracts. A process view of agreements between parties is…

Software Engineering · Computer Science 2007-05-23 Aspassia Daskalopulu

While object diagrams (ODs) are widely used as a means to document object-oriented systems, they are expressively weak, as they are limited to describe specific possible snapshots of the system at hand. In this paper we introduce modal…

Software Engineering · Computer Science 2014-09-09 Shahar Maoz , Jan Oliver Ringert , Bernhard Rumpe

Specifying properties can be challenging work. In this paper, we propose an automated approach to exemplify properties given in the form of automata extended with timing constraints and timing parameters, and that can also encode…

Formal Languages and Automata Theory · Computer Science 2022-06-08 Étienne André , Masaki Waga , Natsuki Urabe , Ichiro Hasuo

Following a line of research initiated in \cite{BBNN}, I describe a general framework for turning reduction concepts of relative computability into diagrams forming an analogy with the Cicho\'n diagram for cardinal characteristics of the…

Logic · Mathematics 2020-02-10 Corey Switzer