Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Stubborn sets for reduced state generation
APN 90 Proceedings on Advances in Petri nets 1990
Theoretical Computer Science - Selected papers of the International BCS-FACS Workshop on Semantics for Concurrency, Leicester, UK, July 1990
Handbook of logic in computer science (vol. 4)
Confluence for process verification
Theoretical Computer Science
Models for concurrency: towards a classification
Theoretical Computer Science
On the models for asynchronous circuit behaviour with OR causality
Formal Methods in System Design
Stubborn set methods for process algebras
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Partial confluence of processes and systems of objects
Theoretical Computer Science
Refinement of actions and equivalence notions for concurrent systems
Acta Informatica
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Petri Nets, Event Structures and Domains
Proceedings of the International Sympoisum on Semantics of Concurrent Computation
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
All from One, One for All: on Model Checking Using Representatives
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Configuration structures, event structures and Petri nets
Theoretical Computer Science
True-concurrency probabilistic models
Information and Computation
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
| Hi-index | 0.00 |
In prime event structures with binary conflicts (pes-bc) a branching cell [1] is a subset of events closed under downward causality and immediate conflict relations. This means that no event outside the branching cell can be in conflict with or enable any event inside the branching cell. It bears a strong resemblance to stubborn sets, a partial order reduction method on transition systems. A stubborn set (at a given state) is a subset of actions such that no execution consisting entirely of actions outside the stubborn set can be in conflict with or enable actions that are inside the stubborn set. A rigorous study of the relationship between the two ideas, however, is not straightforward due to the facts that 1) stubborn sets utilise sophisticated causality and conflict relations that invalidate the stability and coherence of event structures [18], 2) without stability it becomes very difficult to define concepts like prefixes and branching cells, which prerequire a clear notion of causality, and 3) it is challenging to devise a technique for identifying 'proper' subsets of transitions as 'events' such that the induced event-based system captures exactly the causality and conflict information needed by stubborn sets. In this paper we give a solution to the problems by providing an unfolding of labelled transition systems into configuration structures, a more general structure supporting or-causality and finite conflict. We show that the branching cell definition can be extended to configuration structures and that each branching cell in the unfolding is a long-lived stubborn set, such that no matter how the system evolves, what remains of the branching cell is always a stubborn set.