Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
Nonsequential processes
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
The synthesis problem for elementary net systems is NP-complete
Theoretical Computer Science
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
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
On the origin of events: branching cells as stubborn sets
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Revisiting timed specification theories: a linear-time perspective
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
In process semantics of Petri Net, a non-sequential process is a concurrent run of the system represented in a partial order-like structure. For transition systems it is possible to define a similar notion of concurrent run by utilising the idea of confluence. Basically a confluent process is an acyclic confluent transition system that is a partial unfolding of the original system. Given a non-confluent transition system G, how to find maximal confluent processes of G is a theoretical problem having many practical applications. In this paper we propose an unfolding procedure for extracting maximal confluent processes from transition systems. The key technique we utilise in the procedure is the construction of granular configuration structures (i.e. a form of event structures) based on diamond-structure information inside transition systems.