Skip to main content
SpringerLink
Log in

Factorisation of transition systems

  • Original Article
  • Published:
Acta Informatica Aims and scope Submit manuscript

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).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

Notes

  1. Those properties could be expressed in terms of categories, but we shall refrain from doing this here.

  2. Again, those properties could be expressed in terms of categories, but we shall refrain from doing this here.

References

  1. Arnold, A.: Finite Transition Systems—Semantics of Communicating Systems. Prentice Hall international series in computer science, Prentice Hall, UK (1994)

  2. Badouel, E., Bernardinello, L., Darondeau, P.: Petri Net Synthesis. Springer, Berlin (2015)

    Book  MATH  Google Scholar 

  3. Bednarczyk, M. A.: Categories of asynchronous systems. PhD thesis, University of Sussex, UK (1987)

  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)

  5. Best, E., Devillers, R., Koutny, M.: Petri net algebra. Monographs in Theoretical Computer Science. Springer, Berlin (2001)

  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)

  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)

  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)

  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)

  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)

    Article  Google Scholar 

  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 

Download references

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.

Author information

Authors and Affiliations

  1. Département d’Informatique, Université Libre de Bruxelles, Brussels, Belgium

    Raymond Devillers

Authors
  1. Raymond Devillers
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Raymond Devillers.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Devillers, R. Factorisation of transition systems. Acta Informatica 55, 339–362 (2018). https://doi.org/10.1007/s00236-017-0300-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-017-0300-y

Search

Navigation