A Complete Finite Prefix for Process Algebra

Langerak, Rom; Brinksma, Ed

doi:10.1007/3-540-48683-6_18

Cited by 18 publications

(36 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Event structures arise naturally under the partial order unfolding semantics for Petri nets , and also as a natural semantics for process algebras (see, e.g. the work of Langerak and Brinksma ). The state reached after some execution is represented by a configuration of the event structure, which is a conflict‐free, history‐closed set of events.…”

Section: Introductionmentioning

confidence: 99%

Model‐based testing for concurrent systems with labelled event structures

León

Haar

Longuet

2014

Software Testing Verif & Rel

View full text Add to dashboard Cite

SUMMARYWe propose a theoretical testing framework and a test generation algorithm for concurrent systems specified with true‐concurrency models, such as Petri nets or networks of automata. The semantic model of computation of such formalisms is labelled event structures, which allow to represent concurrency explicitly. We introduce the notions of strong and weak concurrency: strongly concurrent events must be concurrent in the implementation, while weakly concurrent ones may eventually be ordered. The ioco type conformance relations for sequential systems rely on the observation of sequences of actions and blockings; thus, they are not capable of capturing and exploiting concurrency of non‐sequential behaviours. We propose an extension of ioco for labelled event structures, named co‐ioco, allowing to deal with strong and weak concurrency. We extend the notions of test cases and test execution to labelled event structures and give a test generation algorithm building a complete test suite for co‐ioco. Copyright © 2014 John Wiley & Sons, Ltd.

show abstract

Section: Introductionmentioning

confidence: 99%

Model‐based testing for concurrent systems with labelled event structures

León

Haar

Longuet

2014

Software Testing Verif & Rel

View full text Add to dashboard Cite

show abstract

“…Although unfoldings are usually infinite, it is observed in [McM95] that we can always construct a finite initial prefix of the unfolding which captures its entire behaviour, and which in many cases is much smaller than the state space of the system. Unfoldings have been applied to n-safe (i.e., finite-state) Petri nets, and more recently to other classes of finite-state systems such as synchronous products of finite transition systems [LB99,ER99] In a parallel development, there has been numerous efforts, to extend the applicability of model checking to the domain of infinite-state systems. This has resulted in several highly nontrivial algorithms for verification of timed automata, lossy channel systems, (unbounded) Petri nets, broadcast protocols, relational automata, parametrized systems, etc.…”

Section: Introductionmentioning

confidence: 99%

Unfoldings of Unbounded Petri Nets

Abdulla

Iyer

Nylén

2000

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Net unfoldings have attracted much attention as a powerful technique for combating state space explosion in model checking. The method has been applied to verification of 1-safe (finite) Petri nets, and more recently also to other classes of finite-state systems such as synchronous products of finite transition systems. We show how unfoldings can be extended to the context of infinite-state systems. More precisely, we apply unfoldings to get an efficient symbolic algorithm for checking safety properties of unbounded Petri nets. We demonstrate the advantages of our method by a number of experimental results.

show abstract

“…Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan [19]. It can be applied to systems modeled by Petri nets, communicating automata, or process algebras [10,9,18]. The method is based on the notion of unfolding, which can be seen as the partial order version of an (infinite) computation tree [10,3].…”

Section: Introductionmentioning

confidence: 99%

Model Checking with Finite Complete Prefixes Is PSPACE-Complete

Heljanko

2000

CONCUR 2000 — Concurrency Theory

View full text Add to dashboard Cite

Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a symbolic representation of an interleaved reachability graph. We show that model checking a fixed size formula of several temporal logics, including LTL, CTL, and CTL * , is PSPACE-complete in the size of a finite complete prefix of a 1-safe Petri net. This proof employs a class of 1-safe Petri nets for which it is easy to generate a finite complete prefix in polynomial time.

show abstract

A Complete Finite Prefix for Process Algebra

Cited by 18 publications

References 18 publications

Model‐based testing for concurrent systems with labelled event structures

Model‐based testing for concurrent systems with labelled event structures

Unfoldings of Unbounded Petri Nets

Model Checking with Finite Complete Prefixes Is PSPACE-Complete

Contact Info

Product

Resources

About