Skip to main content
SpringerLink
Log in

Logic Unification of Behavioral Equivalences of Timed Event Structures

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

We propose a uniform logic characterization of some timed extensions of partial order based equivalences (pomset trace equivalence, testing equivalence, history preserving bisimulation, and hereditary history preserving bisimulation) in the setting of a true concurrency model timed event structures.

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

Similar content being viewed by others

References

  1. A. Joyal, M. Nielsen, and C. Winskel, “Bisimulation from open maps,” Inf. Comput. 127, No. 2, 164-185 (1996).

    Article  MATH  MathSciNet  Google Scholar 

  2. G. L. Cattani and V. Sassone, “Higher dimensional transition systems,” In: 11th Annual IEEE Symp. Logic Comp. Sci., pp. 55–62, IEEE Comp. Soc. Press, Washington (1996).

  3. M. Nielsen and A. Cheng, “Observing behaviour categorically,” Lect. Notes Comp. Sci. 1026, 263–278 (1995).

    Article  MathSciNet  Google Scholar 

  4. E. S. Oshevskaya, “Open maps bisimulations for higher dimensional automata models,” Lect. Notes Comp. Sci. 5699, 274–286 (2009).

    Article  Google Scholar 

  5. T. Hune and M. Nielsen, “Bisimulation and open maps for timed transition systems,” Fundam. Inform. 38, 61–77 (1999).

    MATH  MathSciNet  Google Scholar 

  6. I. B. Virbitskaite and N. S. Gribovskaya, “Open maps and observational equivalences for timed partial order models,” Fundam. Inform. 60, No. 1–4, 383–399 (2004).

    MATH  MathSciNet  Google Scholar 

  7. N. S. Gribovskaya and I. B. Virbitskaite, “Timed delay bisimulation is an equivalence relation for timed transition systems,” Fundam. Inform. 93, No. 1–3, 127–142 (2009).

    MATH  MathSciNet  Google Scholar 

  8. I. B. Virbitskaite, N. S. Gribovskaya, and E. Best, “A categorical view of timed behaviours,” Fundam. Inform. 102, No. 1, 129–143 (2010).

    MATH  MathSciNet  Google Scholar 

  9. G. Winskel, “An introduction to event structures,” Lect. Notes Comp. Sci. 354, 364–397 (1988).

    Article  MathSciNet  Google Scholar 

  10. G. Boudol and I. Castellani, “Concurrency and atomicity,” Theor. Comp. Sci. 59, 25–84 (1989).

    Article  MathSciNet  Google Scholar 

  11. A. Joyal and I. Moerdijk, “A completeness theorem for open maps,” Ann. Pure Appl. Logic 70, 51–86 (1997).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. A. P. Ershov Institute of Informatics Systems SB RAS, 6, Acad. Lavrent’ev pr., Novosibirsk, 630090, Russia

    N. S. Gribovskaya

Authors
  1. N. S. Gribovskaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to N. S. Gribovskaya.

Additional information

Translated from Vestnik Novosibirskogo Gosudarstvennogo Universiteta: Seriya Matematika, Mekhanika, Informatika 13, No. 1, 2013, pp. 32–46.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gribovskaya, N.S. Logic Unification of Behavioral Equivalences of Timed Event Structures. J Math Sci 203, 478–489 (2014). https://doi.org/10.1007/s10958-014-2151-1

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-014-2151-1

Keywords

Search

Navigation