Advertisement

Acta Informatica

, Volume 55, Issue 4, pp 339–362 | Cite as

Factorisation of transition systems

  • Raymond DevillersEmail author
Original Article

Abstract

It is well-known that the reachability graph of a sum of disjoint Petri nets is the disjoint product of the reachability graphs of the components. We shall consider here the converse problem, i.e., determine when and how a transition system may be decomposed in non-trivial concurrent factors, and extend the theory to more general labelled transition systems. Meanwhile, we shall develop interesting algebraic properties of disjoint products. The present paper is an extended version of Devillers (in: Desel, Yakovlev (eds) Proceedings 16th international conference on application of concurrency to system design (ACSD 2016), 2016).

Notes

Acknowledgements

The author would like to thank prof. Eike Best for his encouragements, and prof. Gilles Geeraerts for his support. The anonymous referees made an exceptional job, exhibiting a deep understanding and affording interesting remarks.

References

  1. 1.
    Arnold, A.: Finite Transition Systems—Semantics of Communicating Systems. Prentice Hall international series in computer science, Prentice Hall, UK (1994)Google Scholar
  2. 2.
    Badouel, E., Bernardinello, L., Darondeau, P.: Petri Net Synthesis. Springer, Berlin (2015)CrossRefzbMATHGoogle Scholar
  3. 3.
    Bednarczyk, M. A.: Categories of asynchronous systems. PhD thesis, University of Sussex, UK (1987)Google Scholar
  4. 4.
    Best, E., Devillers, R.: Synthesis of bounded choice-free Petri nets. In: Aceto, L., Frutos Escrig D. (eds.) Proceedings of 26th International Conference on Concurrency Theory (CONCUR 2015), pp. 128–141 (2015)Google Scholar
  5. 5.
    Best, E., Devillers, R., Koutny, M.: Petri net algebra. Monographs in Theoretical Computer Science. Springer, Berlin (2001)Google Scholar
  6. 6.
    Büchi, J.R.: On a decision method in restricted second order arithmetic. In: The 1960 Congress on Logic. Methdology and Philosophy of Science, pp. 1–11. Univeristy Press, Stanford (1962)Google Scholar
  7. 7.
    Devillers, R.: Products of transition systems and additions of Petri nets. In: Desel, J., Yakovlev, A. (eds.) Proceedings 16th International Conference on Application of Concurrency to System Design (ACSD 2016), pp. 65–73 (2016)Google Scholar
  8. 8.
    Hildebrandt, T.T., Sassone, V.: Comparing transition systems with independence and asynchronous transition systems. In: Proceedings of CONCUR ’96, Concurrency Theory, 7th International Conference, Pisa, Italy, pp. 84–97 (1996)Google Scholar
  9. 9.
    Keller, R.M.: A fundamental theorem of asynchronous parallel computation. In: Sagamore Computer Conference, August 20–23, 1974, LNCS Vol. 24, pp. 102–112 (1975)Google Scholar
  10. 10.
    Teruel, E., Colom, J.M., Silva, M.: Choice-free Petri nets: a model for deterministic concurrent systems with bulk services and arrivals. IEEE Transactions on Systems, Man, and Cybernetics, Part A 27(1), 73–83 (1997)CrossRefGoogle Scholar
  11. 11.
    Winskel, G., Nielsen, M.: Models for concurrency. In: Abramsky, S., Gabbay Dov, M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. 4, pp. 1–148. Oxford University Press, Oxford (1995)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2017

Authors and Affiliations

  1. 1.Département d’InformatiqueUniversité Libre de BruxellesBrusselsBelgium

Personalised recommendations