# Kleene Theorems for Free Choice Nets Labelled with Distributed Alphabets

@article{Phawade2018KleeneTF, title={Kleene Theorems for Free Choice Nets Labelled with Distributed Alphabets}, author={Ramchandra Phawade}, journal={ArXiv}, year={2018}, volume={abs/1907.01168} }

We provided (PNSE'2014) expressions for free choice nets having "distributed choice property" which makes the nets "direct product" representable.
In a recent work (PNSE'2016), we gave equivalent syntax for a larger class of free choice nets obtained by dropping distributed choice property.
In both these works, the classes of free choice nets were restricted by a "product condition" on the set of final markings. In this paper we do away with this restriction and give expressions for the… Expand

#### 2 Citations

Kleene Theorems for Free Choice Automata over Distributed Alphabets

- Computer Science
- Trans. Petri Nets Other Model. Concurr.
- 2019

In a recent work, equivalent syntax for a larger class of free choice nets obtained by dropping distributed choice property is given. Expand

Transactions on Petri Nets and Other Models of Concurrency XIV

- Computer Science
- Trans. Petri Nets and Other Models of Concurrency
- 2019

It is shown that process mining provides a wealth of opportunities for people doing research on Petri nets and related models of concurrency, and a range of process discovery and conformance checking techniques are described. Expand

#### References

SHOWING 1-10 OF 19 REFERENCES

Kleene Theorem for Labelled Free Choice Nets without Distributed Choice

- Mathematics, Computer Science
- PNSE @ Petri Nets
- 2016

This work gives equivalent syntax for a larger class of free choice nets obtained by dropping “distributed choice property”, and relates the tuples of blocks of derivatives and their effects– representing automaton transitions–in their expressions. Expand

Kleene Theorems for Labelled Free Choice Nets

- Computer Science
- PNSE @ Petri Nets
- 2014

A “pairing” property in the syntax of this paper allows us to connect to a broader class of product systems, where the conflict-equivalence is not statically fixed. Expand

Kleene Theorems for Synchronous Products with Matching

- Mathematics, Computer Science
- Trans. Petri Nets Other Model. Concurr.
- 2015

A "pairing" property in the syntax of this paper allows us to connect to a broader class of synchronous product systems with a "matching"property, where the conflict-equivalence is not statically fixed. Expand

Kleene Theorems for Product Systems

- Mathematics, Computer Science
- DCFS
- 2011

Kleene theorems are proved for two subclasses of labelled product systems which are inspired from well-studied sub Classes of 1- bounded Petri nets and a corresponding class of expressions is defined. Expand

Computation Sequence Sets

- Computer Science, Mathematics
- J. Comput. Syst. Sci.
- 1976

A class of automata based upon generalized Petri nets is introduced and defined, and the class of CSS languages is shown to be closed under union, intersection, concatenation, and concurrency. Expand

Automata on Distributed Alphabets

- Computer Science
- Modern Applications of Automata Theory
- 2012

A proof of Zielonka’s fundamental theorem connecting regular trace languages to asynchronous automata is provided and a distributed time-stamping algorithm is described that is basic to many interesting constructions involving these automata. Expand

Derivatives of Regular Expressions

- Computer Science
- JACM
- 1964

In this paper the notion of a derivative of a regular expression is introduced atld the properties of derivatives are discussed and this leads, in a very natural way, to the construction of a state diagram from a regularexpression containing any number of logical operators. Expand

Concurrent Regular Expressions and Their Relationship to Petri Nets

- Computer Science
- Theor. Comput. Sci.
- 1992

The proof of equivalence also provides a natural decomposition method for Petri nets and gives a flexible way of specifying concurrent systems. Expand

Product Automata and Process Algebra

- Computer Science
- Fourth IEEE International Conference on Software Engineering and Formal Methods (SEFM'06)
- 2006

A model of labelled product systems of automata is defined and its connections with process calculi and trace languages are explored to lead to complete axiomatizations and algorithms for bisimulation and failure equivalence over labelled products systems. Expand

ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS

- Computer Science
- 1972

This thesis presents results on structural constraints guaranteeing global operation, and decompositions of complex systems into meaningful parts, and for a corresponding class of systems called Production Schemata. Expand