On expanding protocol conformance checking to exception handling

Heike, Christian; Zimmermann, Wolf; Both, Andreas

doi:10.1007/s11761-013-0146-2

Cited by 8 publications

(9 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence, each run in the PRS-abstraction corresponds to a run in the (P,P)-PRS abstraction (which is equivalent to the Petri nets). Thus, the workflow nets [13] lead to a coarser abstraction than using general PRS [6]. Now, we examine the deadlock situations.…”

Section: Correspondence Between (Gg)-prs and (Pp)-prs Abstractionsmentioning

confidence: 99%

“…The behavior of recursive procedures and synchronous procedure calls corresponds to the LIFO principle and requires therefore a stack [8] to trace the calling context. Process rewrite systems (PRSs) are an extension of Petri nets by stacks [9] and therefore PRS allow to model the behavior of (recursive) procedure calls, concurrency (fork), synchronization and exception handling [6].…”

Section: Introductionmentioning

confidence: 99%

“…Furthermore, [6] shows that there is a correspondence between process algebraic expressions defined by an abstraction based on process-algebras and cactus stacks (introduced as tree of stacks by [4]). Therefore, we focus on PRSs which include pushdown systems as well as Petri nets.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

On Abstraction-Based Deadlock-Analysis in Service-Oriented Systems with Recursion

Weißbach

Zimmermann

2017

Service-Oriented and Cloud Computing

Self Cite

View full text Add to dashboard Cite

We examine deadlock analysis for service-oriented systems with unbound concurrency and unbound recursion. In particular, abstraction-based approaches are considered, i.e., abstract behavior models are derived from service implementations and composed according to the architecture of service-oriented systems. It turns out that there are some limitations of Petri-net-based approaches, e.g., such as workflow nets if deadlocks are analyzed. We show an example that ends in a deadlock if recursion is considered but on a Petri-net-based abstraction, it may regularly end.

show abstract

Section: Correspondence Between (Gg)-prs and (Pp)-prs Abstractionsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On Abstraction-Based Deadlock-Analysis in Service-Oriented Systems with Recursion

Weißbach

Zimmermann

2017

Service-Oriented and Cloud Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…He verified concurrent exception handling related security attributes, asserted the security attributes, and used FDR to analyse validation. Wolf Zimmermann (Heike et al, 2013) proposed an approach for checking whether service protocols are obeyed in a service composition. Service protocols specified for a service legal sequences of operation calls.…”

Section: Modelling and Verification Of Exception Handlingmentioning

confidence: 99%

Verifying integrity of exception handling in service-oriented software

Xue

Song

et al. 2017

IJGUC

View full text Add to dashboard Cite

show abstract

“…We thank Wolf Zimmermann for pointing out that the argument applies more generally to Mayr's Process Rewrite Systems[12]. They have been used in[11] to verify protocols for services which may rise exceptions.…”

mentioning

confidence: 99%

A Characterization of Distributed ASMs with Partial-Order Runs

Börger

Schewe

2020

Rigorous State-Based Methods

View full text Add to dashboard Cite

To overcome the practical limitations of partial-order runs of 'distributed ASMs' (Abstract State Machines) proposed by Gurevich, we have defined a concept of concurrent runs of multi-agent ASMs and could show that concurrent ASMs capture a natural language-independent axiomatic definition of concurrent algorithms, thus generalising Gurevich's seminal 'Sequential ASM Thesis' from sequential to concurrent algorithms. However, we remained intrigued by the fact that Blass and Gurevich used partial-order runs of distributed ASMs to explain runs of sequential recursive algorithms. We discovered that also the inverse simulation holds: for every distributed ASM with partial order runs, these runs can be described by runs of a sequential recursive algorithm. This surprising result clarifies the difference in expressivity between partialorder and concurrent runs.

show abstract

On expanding protocol conformance checking to exception handling

Cited by 8 publications

References 32 publications

On Abstraction-Based Deadlock-Analysis in Service-Oriented Systems with Recursion

On Abstraction-Based Deadlock-Analysis in Service-Oriented Systems with Recursion

Verifying integrity of exception handling in service-oriented software

A Characterization of Distributed ASMs with Partial-Order Runs

Contact Info

Product

Resources

About