Skip to main content
SpringerLink
Log in

Characterizing Timed Net Processes Categorically

  • Conference paper
  • First Online:
Book cover Parallel Computing Technologies (PaCT 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2127))

Included in the following conference series:

  • 328 Accesses

Abstract

The paper aims at extending the categorical approach to Petri net based models with time constraints. We define a category of net processes with dense time, and use the general framework of open maps to obtain a notion of bisimulation. We show this to be equivalent to the standard notion of timed bisimulation. Next, decidability of timed bisimulation is shown in the setting of finite net processes. Further, the result on decidability is applied to time safe Petri nets, using a timed version of the McMillan-unfolding.

This work is partially supported by the Russian Fund of Basic Research (Grant N 00-01-00898).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Aceto, D. Murphi. Timing and causality in process algebra. Acta Informatica 33(4) (1996) 317–350.

    Article  MATH  MathSciNet  Google Scholar 

  2. R. Alur, D. Dill. The theory of timed automata. Theoretical Computer Science 126 (1994) 183–235.

    Article  MATH  MathSciNet  Google Scholar 

  3. T. Aura, J. Lilius. Time processes for time Petri nets. Lecture Notes in Computer Science 1248 (1997) 136–155.

    Google Scholar 

  4. B. Bieber, H. Fleischhack. Model checking of time Petri nets based on partial order semantics. Lecture Notes in Computer Science 1662 (1999) 211–225.

    Google Scholar 

  5. C. Brown, D. Gurr. Timing Petri nets categorically. Lecture Notes in Computer Science 623 (1992) 571–582.

    Google Scholar 

  6. R.T. Casley, R.F. Crew, J. Meseguer, V.R. Pratt. Temporal structures. Mathematical Structures in Computer Science 1(2) (1991) 179–213.

    Article  MATH  MathSciNet  Google Scholar 

  7. K. Čerāns. Decidability of bisimulation equivalences for parallel timer processes. Lecture Notes in Computer Science 663 (1993) 302–315.

    Google Scholar 

  8. J. Engelfriet. Branching processes of Petri nets. Acta Informatica 28 (1991) 576–591.

    Article  MathSciNet  Google Scholar 

  9. J. Esparza, S. Roemer, W. Vogler An improvement of McMillan’s unfolding algorithm. Lecture Notes in Computer Science 1055 (1996) (87–106).

    Google Scholar 

  10. M. Hennessy, R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of ACM 32 (1985) 137–162.

    Article  MATH  MathSciNet  Google Scholar 

  11. T. Hune, M. Nielsen. Bisimulation and open maps for timed transition systems. Fundamenta Informaticae 38(1–2) (1999) 61–77.

    MATH  MathSciNet  Google Scholar 

  12. A. Joyal, M. Nielsen, G. Winskel. Bisimulation from open maps. Information and Computation 127(2) (1996) 164–185.

    Article  MATH  MathSciNet  Google Scholar 

  13. J.-P. Katoen, R. Langerak, D. Latella, E. Brinksma. On specifying real-time sys-tems in a causality-based setting. Lecture Notes in Computer Science 1135 (1996) 385–404.

    Google Scholar 

  14. F. Laroussinie, K.G. Larsen, C. Weise. From timed automata to logic and back. Lecture Notes in Computer Science 969 (1995) 529–539.

    Google Scholar 

  15. J. Lilius. Efficient state space search for time Petri nets. Proc. MFCS’98 Workshop on Concurrency, August 1998, Brno (Czech Republic), FIMU Report Series, FIMU RS-98-06 (1998) 123–130.

    Google Scholar 

  16. P. Merlin, D.J. Faber. Recoverability of communication protocols. IEEE Trans. of Communication COM-24(9) (1976).

    Google Scholar 

  17. J. Meseguer, U. Montanari. Petri nets are monoids. Information and Computation 88 (1990) 105–154.

    Article  MATH  MathSciNet  Google Scholar 

  18. J. Meseguer, U. Montanari, V. Sassone. Process versus unfolding semantics for Place/Transition Petri nets. Theoretical Computer Science 153 (1996) 171–210.

    Article  MATH  MathSciNet  Google Scholar 

  19. K. McMillan. Symbolic model checking-an aproach to the state explosion problem. PhD Thesis, SCS, Carnegie Mellon University (1992).

    Google Scholar 

  20. D. Murphy. Time and duration in noninterleaving concurrency. Fundamenta Informaticae 19 (1993) 403–416.

    MATH  MathSciNet  Google Scholar 

  21. X. Nicolin, J. Sifakis. An overview and synthesis on timed process algebras. Lecture Notes in Computer Science 600 (1992) 526–548.

    Chapter  Google Scholar 

  22. M. Nielsen, A. Cheng. Observing behaviour categorically. Lecture Notes in Computer Science 1026 (1996) 263–278.

    Google Scholar 

  23. M. Nielsen, G. Winskel. Petri nets and bisimulation. Theoretical Computer Science 153 (1996).

    Google Scholar 

  24. C. Ramchandani. Analysis of asynchronous concurrent systems by timed Petri nets. Cambridge, Mass.: MIT, Dept. Electronical Engineering, PhD Thesis, 1974.

    Google Scholar 

  25. V. Sassone. On the category of Petri Net Computations. Lecture Notes in Computer Science 915 (1995) 334–348.

    Google Scholar 

  26. V. Valero, D. de Frutos, F. Cuartero. Timed Processes of Timed Petri Nets. Lecture Notes in Computer Science 935 (1995) 490–509.

    Google Scholar 

  27. C. Weise, D. Lenzkes. Efficient scaling-invariant checking of timed bisimulation. Lecture Notes in Computer Science 1200 (1997) 176–188.

    Chapter  Google Scholar 

  28. G. Winskel. Petri nets, algebras, morphisms, compositionality. Information and Computation 72 (1987) 197–238.

    Article  MATH  MathSciNet  Google Scholar 

  29. G. Winskel, M. Nielsen. Models for concurrency. In Handbook of Logic in Computer Science 4 (1995).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Siberian Division of the Russian Academy of Sciences, Institute of Informatics Systems, 6, Acad. Lavrentiev avenue, 630090, Novosibirsk, Russia

    I. B. Virbitskaite

Authors
  1. I. B. Virbitskaite
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Supercomputer Software Department, ICMand MG SB RAS, pr. Lavrentiev 6, 630090, Novosibirsk, Russia

    Victor Malyshkin

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Virbitskaite, I.B. (2001). Characterizing Timed Net Processes Categorically. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2001. Lecture Notes in Computer Science, vol 2127. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44743-1_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-44743-1_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42522-9

  • Online ISBN: 978-3-540-44743-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation