Structure Theory of Equal Conflict Systems

Abstract Equal conflict net systems are a weighted generalisation of the (extended) free choice subclass that keeps the total autonomy of choices. A substantial part of the analytical branch of the structure theory of free choice systems, including decomposition and duality, the rank theorem, characterisations of impartial sequences and prompt interfaces, and the existence of home states, is extended to the equal conflict case. In so doing, several familiar concepts and objects from the structure theory of place/transition net systems are revisited from a linear algebraic perspective, which is specially adequate to cope with weighted nets.

[1]  Jörg Desel,et al.  A Proof of the Rank Theorem for Extended Free Choice Nets , 1992, Application and Theory of Petri Nets.

[2]  Giovanni Chiola.  On the structural and behavioural characterization of P/T nets , 1993, Proceedings of 5th International Workshop on Petri Nets and Performance Models.

[3]  Neil D. Jones,et al.  Complexity of Some Problems in Petri Nets , 1977, Theor. Comput. Sci..

[4]  Manuel Silva Suárez,et al.  Modelling and Analysis of Deterministic Concurrent Systems with Bulk Services and Arrivals , 1993, Decentralized and Distributed Systems.

[5]  K. Lautenback.  Linear algebraic calculation of deadlocks and traps , 1987 .

[6]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[7]  P. S. Thiagarajan,et al.  A Theory of Bipolar Synchronization Schemes , 1984, Theor. Comput. Sci..

[8]  P. S. Thiagarajan,et al.  Some classes of live and safe Petri nets , 1987 .

[9]  Jörg Desel,et al.  Reachability in Cyclic Extended Free-Choice Systems , 1993, Theor. Comput. Sci..

[10]  Manuel Silva Suárez,et al.  On the analysis and synthesis of free choice systems , 1991, Applications and Theory of Petri Nets.

[11]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[12]  Manuel Silva Suárez,et al.  Liveness and Home States in Equal Conflict Systems , 1993, Application and Theory of Petri Nets.

[13]  Kurt Lautenbach,et al.  The Orderly Resolution of Memory Access Conflicts Among Competing Channel Processes , 1982, IEEE Transactions on Computers.

[14]  Nicolas Beldiceanu,et al.  Deterministic Systems of Sequential Processes: Theory and Tools , 1988, Concurrency.

[15]  Michel Hack,et al.  ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS , 1972 .

[16]  Jörg Desel,et al.  Traps Characterize Home States in Free Choice Systems , 1992, Theor. Comput. Sci..

[17]  Eike Best,et al.  Structure Theory of Petri Nets: the Free Choice Hiatus , 1986, Advances in Petri Nets.

[18]  Manuel Silva,et al.  A polynomial-time algorithm to decide liveness of bounded free choice nets , 1992 .

[19]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[20]  Gérard Roucairol,et al.  Linear Algebra in Net Theory , 1979, Advanced Course: Net Theory and Applications.

[21]  Manuel Silva Suárez,et al.  On Weighted T-Systems , 1992, Application and Theory of Petri Nets.

[22]  Manuel Silva,et al.  Properties and performance bounds for closed free choice synchronized monoclass queueing networks , 1991 .

[23]  Grzegorz Rozenberg,et al.  Concurrency and Nets , 1987, Springer Berlin Heidelberg.

[24]  P. S. Thiagarajan,et al.  A Fresh Look at Free Choice Nets , 1984, Inf. Control..

[25]  Manuel Silva Suárez,et al.  Well-Formedness of Equal Conflict Systems , 1994, Application and Theory of Petri Nets.