Skip to main content
SpringerLink
Log in
Book cover

International Andrei Ershov Memorial Conference on Perspectives of System Informatics

PSI 2011: Perspectives of Systems Informatics pp 142–152Cite as

A Logic Characteristic for Timed Extensions of Partial Order Based Equivalences

  • Conference paper

  • 489 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7162))

Abstract

The intention of the paper is to provide a uniform logic characteristic for timed extensions of partial order based equivalences (pomset trace equivalence, history preserving bisimulation and hereditary history preserving bisimulation) in the setting of timed event structures. For this purpose, we use open maps based characterizations of the equivalences, provided in [10], and the logics of path assertions from [6].

This work is supported in part by DFG-RFBR (grant No 436 RUS 113/1002/01, grant No 09-01-91334).

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boudol, G., Castellani, I.: Concurrency and atomicity. Theoretical Computer Science 59, 25–84 (1989)

    Article  MathSciNet  Google Scholar 

  2. Cattani, G.L., Sassone, V.: Higher dimentional transition systems. In: 11th Annual IEEE Symp. on Logic in Computer Science, pp. 55–62. IEEE Comp. Soc. Press, Washington (1996)

    Google Scholar 

  3. Gribovskaya, N.S., Virbitskaite, I.B.: Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems. Fundamenta Informaticae 93(1-3), 127–142 (2009)

    MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  5. Joyal, A., Moerdijk, I.: A completeness theorem for open maps. Annual Pure Applied Logic 70, 51–86 (1997)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Katoen, J.-P., Langerak, R., Latella, D., Brinksma, E.: On Specifying Real-time Systems in a Causality-based Setting. In: Jonsson, B., Parrow, J. (eds.) FTRTFT 1996. LNCS, vol. 1135, pp. 385–404. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  8. Nielsen, M., Cheng, A.: Observing Behaviour Categorically. In: Thiagarajan, P.S. (ed.) FSTTCS 1995. LNCS, vol. 1026, pp. 263–278. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  9. Oshevskaya, E.S.: Open Maps Bisimulations for Higher Dimensional Automata Models. In: Kutyłowski, M., Charatonik, W., Gębala, M. (eds.) FCT 2009. LNCS, vol. 5699, pp. 274–286. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  10. Virbitskaite, I.B., Gribovskaya, N.S.: Open maps and observational equivalences for timed partial order models. Fundamenta Informaticae 60(1-4), 383–399 (2004)

    MathSciNet  MATH  Google Scholar 

  11. Virbitskaite, I.B., Gribovskaya, N.S., Best, E.: A Categorical View of Timed Behaviours. Fundamenta Informaticae 102(1), 129–143 (2010)

    MathSciNet  MATH  Google Scholar 

  12. Winskel, G.: An Introduction to Event Structures. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop. LNCS, vol. 354, pp. 364–397. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. A.P. Ershov Institute of Informatics Systems, SB RAS, 6, Acad. Lavrentiev Avenue, 630090, Novosibirsk, Russia

    Natalya S. Gribovskaya

Authors
  1. Natalya S. Gribovskaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Carnegie Mellon University, 5000 Forbes Avenue, 15213-3891, Pittsburgh, PA, USA

    Edmund Clarke

  2. A.P. Ershov Institute of Informatics Systems Siberian Branch of the Russian Academy of Sciences, 6, Acad. Lavrentiev ave, Novosibirsk, 630090, Russia

    Irina Virbitskaite

  3. The University of Manchester, Oxford Road, M13 9PL, Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gribovskaya, N.S. (2012). A Logic Characteristic for Timed Extensions of Partial Order Based Equivalences. In: Clarke, E., Virbitskaite, I., Voronkov, A. (eds) Perspectives of Systems Informatics. PSI 2011. Lecture Notes in Computer Science, vol 7162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29709-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29709-0_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29708-3

  • Online ISBN: 978-3-642-29709-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation