English
Related papers

Related papers: Process Behaviour: Formulae vs. Tests (Extended Ab…

200 papers

A good process model is expected not only to reflect the behavior of the process, but also to be as easy to read and understand as possible. Because preferences vary across different applications, numerous measures provide ways to reflect…

Formal Languages and Automata Theory · Computer Science 2024-08-23 Patrizia Schalk , Adam Burke , Robert Lorenz

We define a testing equivalence in the spirit of De Nicola and Hennessy for reactive probabilistic processes, i.e. for processes where the internal nondeterminism is due to random behaviour. We characterize the testing equivalence in terms…

Logic in Computer Science · Computer Science 2010-06-29 Sonja Georgievska , Suzana Andova

There are two fundamentally different approaches to specifying and verifying properties of systems. The logical approach makes use of specifications given as formulae of temporal or modal logics and relies on efficient model checking…

Logic in Computer Science · Computer Science 2013-06-05 Nikola Beneš , Benoît Delahaye , Uli Fahrenberg , Jan Křetínský , Axel Legay

May and must testing were introduced by De Nicola and Hennessy to define semantic equivalences on processes. May-testing equivalence exactly captures safety properties, and must-testing equivalence liveness properties. This paper proposes…

Logic in Computer Science · Computer Science 2019-08-01 Rob van Glabbeek

Organizations can benefit from the use of practices, techniques, and tools from the area of business process management. Through the focus on processes, they create process models that require management, including support for versioning,…

Programming Languages · Computer Science 2019-09-23 Artem Polyvyanyy , Arthur H. M. ter Hofstede , Marcello La Rosa , Chun Ouyang , Anastasiia Pika

In the standard testing theory of DeNicola-Hennessy one process is considered to be a refinement of another if every test guaranteed by the former is also guaranteed by the latter. In the domain of web services this has been recast, with…

Logic in Computer Science · Computer Science 2015-07-01 Giovanni Bernardi , Matthew Hennessy

In this paper we leverage psychological methods to investigate LLMs' conceptual mastery in applying rules. We introduce a novel procedure to match the diversity of thought generated by LLMs to that observed in a human sample. We then…

Artificial Intelligence · Computer Science 2025-04-23 José Luiz Nunes , Guilherme FCF Almeida , Brian Flanagan

Runtime enforcement is a dynamic analysis technique that uses monitors to enforce the behaviour specified by some correctness property on an executing system. The enforceability of a logic captures the extent to which the properties…

Logic in Computer Science · Computer Science 2018-07-04 Luca Aceto , Ian Cassar , Adrian Francalanza , Anna Ingolfsdottir

Several application domains require formal but flexible approaches to the comparison problem. Different process models that cannot be related by behavioral equivalences should be compared via a quantitative notion of similarity, which is…

Logic in Computer Science · Computer Science 2010-06-29 Alessandro Aldini

Before we combine actions and probabilities two very obvious questions should be asked. Firstly, what does "the probability of an action" mean? Secondly, how does probability interact with nondeterminism? Neither question has a single…

Software Engineering · Computer Science 2011-06-22 Steve Reeves , David Streader

Interpretability provides a means for humans to verify aspects of machine learning (ML) models and empower human+ML teaming in situations where the task cannot be fully automated. Different contexts require explanations with different…

Machine Learning · Computer Science 2024-07-15 Zixi Chen , Varshini Subhash , Marton Havasi , Weiwei Pan , Finale Doshi-Velez

The combination of nondeterminism and probability in concurrent systems lead to the development of several interpretations of process behavior. If we restrict our attention to linear properties only, we can identify three main approaches to…

Logic in Computer Science · Computer Science 2018-08-28 Valentina Castiglioni

In standard process algebra, parallel components do not share a common state and communicate through synchronisation. The advantage of this type of communication is that it facilitates compositional reasoning. For modelling and analysing…

Logic in Computer Science · Computer Science 2020-09-01 Mark Bouwman , Bas Luttik , Wouter Schols , Tim A. C. Willemse

We regard explanations as a blending of the input sample and the model's output and offer a few definitions that capture various desired properties of the function that generates these explanations. We study the links between these…

Machine Learning · Computer Science 2020-01-16 Lior Wolf , Tomer Galanti , Tamir Hazan

Declarative approaches to process modeling are regarded as well suited for highly volatile environments as they provide a high degree of flexibility. However, problems in understanding and maintaining declarative business process models…

Software Engineering · Computer Science 2015-11-12 Cornelia Haisjackl , Stefan Zugal , Pnina Soffer , Irit Hadar , Manfred Reichert , Jakob Pinggera , Barbara Weber

We present the PML 2 language, which provides a uniform environment for programming, and for proving properties of programs in an ML-like setting. The language is Curry-style and call-by-value, it provides a control operator (interpreted in…

Logic in Computer Science · Computer Science 2019-01-11 Rodolphe Lepigre

Testing has become an indispensable activity of software development, yet writing good and relevant tests remains a quite challenging task. One well-known problem is that it often is impossible or unrealistic to test for every outcome, as…

Programming Languages · Computer Science 2017-08-18 Dimitri Racordon , Didier Buchs

Explanations of model behavior are commonly evaluated via proxy properties weakly tied to the purposes explanations serve in practice. We contribute a decision theoretic framework that treats explanations as information signals valued by…

Artificial Intelligence · Computer Science 2026-02-24 Ziyang Guo , Berk Ustun , Jessica Hullman

In current practice a formal analysis of hybrid system models is assertion-based. The work presented here is based on features that look beyond functional correctness toward a quantitative evaluation of behavioral attributes. A feature…

Logic in Computer Science · Computer Science 2019-02-25 Antonio Anastasio Bruto da Costa , Goran Frehse , Pallab Dasgupta

Hyperproperties allow one to specify properties of systems that inherently involve not single executions of the system, but several of them at once: observational determinism and non-inference are two examples of such properties used to…

Logic in Computer Science · Computer Science 2025-12-02 Samuel Graepler , Benjamin Monmege , Jean-Marc Talbot
‹ Prev 1 2 3 10 Next ›