Refinement for Transition Systems with Responses

Carbone, Marco; Hildebrandt, Thomas; Perrone, Gian; Wąsowski, Andrzej

doi:10.4204/eptcs.87.5

Cited by 6 publications

(6 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Further investigations would look for a true concurrency semantics for psi-calculi (with initial results presented as [18]), and then see how our encodings fit with the true concurrency models that this semantics would return. One could also look into adding responses to psi-calculus, similar to how is done in [5] for Transition Systems with Responses.…”

Section: Discussionmentioning

confidence: 99%

Concurrency Models with Causality and Events as Psi-calculi

Normann

Prisacariu

Hildebrandt

2014

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

Psi-calculi are a parametric framework for nominal calculi, where standard calculi are found as instances, like the pi-calculus, or the cryptographic spi-calculus and applied-pi. Psi-calculi have an interleaving operational semantics, with a strong foundation on the theory of nominal sets and process algebras. Much of the expressive power of psi-calculi comes from their logical part, i.e., assertions, conditions, and entailment, which are left quite open thus accommodating a wide range of logics. We are interested in how this expressiveness can deal with event-based models of concurrency. We thus take the popular prime event structures model and give an encoding into an instance of psi-calculi. We also take the recent and expressive model of Dynamic Condition Response Graphs (in which event structures are strictly included) and give an encoding into another corresponding instance of psi-calculi. The encodings that we achieve look rather natural and intuitive. Additional results about these encodings give us more confidence in their correctness.Comment: In Proceedings ICE 2014, arXiv:1410.701

show abstract

Section: Discussionmentioning

confidence: 99%

Concurrency Models with Causality and Events as Psi-calculi

Normann

Prisacariu

Hildebrandt

2014

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…The diagram in Fig. 3 provides a visual representation of process P spec described above 6 . Events are denoted via boxes, and arrows describe the relations introduced in the previous section.…”

Section: Dcr Graphsmentioning

confidence: 99%

“…Extending the + and − operators such that f + 1 = f and f − 1 = f, and ω − 1 = ω. We equip with the LTS with notions of accepting runs, incorporating similar notions defined for DCR Graphs [6,32] In other words, an accepting run consider transitions that either execute pending events, or excludes them. Note that since an event e may happen more than once, even processes with only finitely many events may have infinite runs.…”

Section: Semanticsmentioning

confidence: 99%

“…This is particularly important in our case, as compliance specialists in local governments do not have prior training in using verification techniques using temporal logics. Finally, verification is efficient: it relies on refinement of transition systems with responses [6,28], and although the complexity process refinement belongs to the category of NPhard problems [11], we have shown that we can use syntactic restrictions to check compliance in polynomial time.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Business Process Compliance Using Reference Models of Law

López¹,

Debois²,

Slaats³

et al. 2020

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Legal compliance is an important part of certifying the correct behaviour of a business process. To be compliant, organizations might hard-wire regulations into processes, limiting the discretion that workers have when choosing what activities should be executed in a case. Worse, hard-wired compliant processes are difficult to change when laws change, and this occurs very often. This paper proposes a model-driven approach to process compliance and combines a) reference models from laws, and b) business process models. Both reference and process models are expressed in a declarative process language, The Dynamic Condition Response (DCR) graphs. They are subject to testing and verification, allowing law practitioners to check consistency against the intent of the law. Compliance checking is a combination of alignments between events in laws and events in a process model. In this way, a reference model can be used to check different process variants. Moreover, changes in the reference model due to law changes do not necessarily invalidate existing processes, allowing their reuse and adaptation. We exemplify the framework via the alignment of laws and business rules and a real contract change management process, Finally, we show how compliance checking for declarative processes is decidable, and provide a polynomial time approximation that contrasts NP complexity algorithms used in compliance checking for imperative business processes. All-together, this paper presents technical and methodological steps that are being used by legal practitioners in municipal governments in their efforts towards digitalization of work practices in the public sector.

show abstract

“…As shown in [12,13], DCR Graphs can be mapped to the standard Büchi-automata model, characterizing all runs as well as fair runs as the accepting runs, and subsequently verified for safety and liveness properties using the SPIN model checker [9]. However, it can also be represented directly (and more compactly) as a so-called transition system with responses [2], which is simply a labelled transition system where each state is annotated by a set of labels, referred to as the response actions. The accepting runs of a transition system with responses is then the finite or infinite runs where whenever a label is included in the response set of an intermediate state in the run, it will be excluded from the response set in a subsequent state or executed.…”

Section: Introductionmentioning

confidence: 99%

Modular context-sensitive and aspect-oriented processes with dynamic condition response graphs

Hildebrandt

Mukkamala

Zanitti

2013

Proceedings of the 12th Workshop on Foundations of Aspect-Oriented Languages

Self Cite

View full text Add to dashboard Cite

We propose the recently introduced declarative and event-based Dynamic Condition Response (DCR) Graphs process model as a formal basis for modular implementation of context-sensitive and aspect-oriented processes. The proposal is supported by a new join operator allowing modular composition and refinement of DCR Graphs. We give small illustrative examples of DCR Graphs defining context-sensitive processes where context-events dynamically enable and disable the need for authentication and the join operator is used to add authentication to a process. Finally, we discuss the use of formal verification to ensure that processes satisfy safety and liveness properties, and define two liveness properties (deadlock freedom and liveness) that can be verified directly on the state graph for DCR Graphs.

show abstract

Refinement for Transition Systems with Responses

Cited by 6 publications

References 5 publications

Concurrency Models with Causality and Events as Psi-calculi

Concurrency Models with Causality and Events as Psi-calculi

Business Process Compliance Using Reference Models of Law

Modular context-sensitive and aspect-oriented processes with dynamic condition response graphs

Contact Info

Product

Resources

About