Soundness and separability of workflow nets in the stepwise refinement approach

K Van Hee, N Sidorova, M Voorhoeve - … and Theory of Petri Nets 2003 …, 2003 - Springer
Workflow nets are recognized as a modelling paradigm for the business process modelling.
We introduce and investigate several correctness notions for workflow nets, ranging from …

Probabilistic qos and soft contracts for transaction-based web services orchestrations

S Rosario, A Benveniste, S Haar… - IEEE Transactions on …, 2008 - ieeexplore.ieee.org
Service level agreements (SLAs), or contracts, have an important role in web services. They
define the obligations and rights between the provider of a web service and its client, about …

Configuration structures, event structures and Petri nets

RJ van Glabbeek, GD Plotkin - Theoretical Computer Science, 2009 - Elsevier
In this paper the correspondence between safe Petri nets and event structures, due to
Nielsen, Plotkin and Winskel, is extended to arbitrary nets without self-loops, under the …

[HTML][HTML] Reversibility and asymmetric conflict in event structures

I Phillips, I Ulidowski - Journal of Logical and Algebraic Methods in …, 2015 - Elsevier
Reversible computation has attracted increasing interest in recent years, with applications in
hardware, software and biochemistry. We introduce reversible forms of prime event …

Replication, refinement & reachability: complexity in dynamic condition-response graphs

S Debois, TT Hildebrandt, T Slaats - Acta Informatica, 2018 - Springer
We explore the complexity of reachability and run-time refinement under safety and liveness
constraints in event-based process models. Our study is framed in the DCR^ ⋆⋆ process …

Boolean networks: beyond generalized asynchronicity

T Chatain, S Haar, L Paulevé - … and Discrete Complex Systems: 24th IFIP …, 2018 - Springer
Boolean networks are commonly used in systems biology to model dynamics of biochemical
networks by abstracting away many (and often unknown) parameters related to speed and …

Domain and event structure semantics for Petri nets with read and inhibitor arcs

P Baldan, N Busi, A Corradini, GM Pinna - Theoretical Computer Science, 2004 - Elsevier
We propose a functorial concurrent semantics for Petri nets extended with read and inhibitor
arcs, that we call inhibitor nets. Along the lines of the seminal work by Winskel on safe …

Concurrency in Boolean networks

T Chatain, S Haar, J Kolčák, L Paulevé, A Thakkar - Natural Computing, 2020 - Springer
Boolean networks (BNs) are widely used to model the qualitative dynamics of biological
systems. Besides the logical rules determining the evolution of each component with respect …

Process mining reloaded: Event structures as a unified representation of process models and event logs

M Dumas, L García-Bañuelos - Application and Theory of Petri Nets and …, 2015 - Springer
Process mining is a family of methods to analyze event logs produced during the execution
of business processes in order to extract insights regarding their performance and …

Behavioral comparison of process models based on canonically reduced event structures

A Armas-Cervantes, P Baldan, M Dumas… - … Conference, BPM 2014 …, 2014 - Springer
We address the problem of diagnosing behavioral differences between pairs of business
process models. Specifically, given two process models, we seek to determine if they are …