A Domain View of Timed Behaviors

• Autorzy: Dubtsov R. , Oshevskaya E. , Virbitskaite I.

Identyfikatory

DOI

10.3233/FI-2014-1067

• Języki publikacji: EN

Abstrakty

EN

The intention of this paper is to introduce a timed extension of transition systems with independence, and to study its categorical interrelations with other time-sensitive models. In particular, we show the existence of a chain of coreflections leading from a category of the model of timed transition systems with independence to a category of a specially defined model of marked Scott domains. As an intermediate semantics we use a timed extension of occurrence transition systems with independence, able to properly capture causality and independence relations which arise in the presence of time delays.

Słowa kluczowe

EN

domain; existence theorems; time-delay systems; independence; mathematical models

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2014
• Tom: Vol. 133, nr 2/3
• Strony: 133--147
• Opis fizyczny: Bibliogr. 22 poz., rys.

Twórcy

autor

Dubtsov R.

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

autor

Oshevskaya E.

• Sobolev Institute of Mathematics, SB RAS 4, Acad. Koptyug avenue, 630090, Novosibirsk, Russia

autor

Virbitskaite I.

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

Bibliografia

• [1] R. Alur and D.L. Dill. A theory of timed automata. Theoretical computer science, 126(2):183–235, 1994.
• [2] T. Aura and J. Lilius. Time processes for time petri-nets. Lecture Notes in Computer Science, 1248:136–155, 1997.
• [3] C. Baier, J.P. Katoen, and D. Latella. Metric semantics for true concurrent real time. Lecture Notes in Computer Science, 1443:568–579, 1998.
• [4] M.A. Bednarczyk. Categories of asynchronous systems. PhD thesis, University of Sussex, UK, 1987.
• [5] R.T. Casley, R.F. Crew, J. Meseguer, and VR Pratt. Temporal structures. Mathematical Structures in Computer Science, 1(2):179–213, 1982.
• [6] P. Degano, R. Gorrieri, and S. Vigna. On Relating SomeModels for Concurrency. Lecture Notes in Computer Science, 668:15–30, 1993.
• [7] M. Droste. Concurrency, automata and domains. Automata, Languages and Programming, pages 195–208, 1990.
• [8] T.A. Henzinger, A. Pnueli, and Z. Manna. Timed Transition Systems. Lecture Notes in Computer Science, 600:226–251, 1992.
• [9] T.T. Hildebrandt and V. Sassone. Comparing Transition Systems with Independence and Asynchronous Transition Systems. International Conference on Concurrency Theory, pages 84–97, 1996.
• [10] T.T. Hildebrandt and V. Sassone. Transition Systems with Independence and Multi-Arcs. BRICS Report Series RS-97-10, BRICS, Department of Computer Science, University of Aarhus, April, 1997.
• [11] J.P. Katoen, R. Langerak, D. Latella, and E. Brinksma. On Specifying Real-Time Systems in a Causality-Based Setting. Lecture Notes in Computer Science, 1135:385–404, 1996.
• [12] A. Maggiolo-Schettini and J. Winkowski. Towards an algebra for timed behaviours. Theoretical Computer Science, 103(2):335–363, 1992.
• [13] S. McLane. Categories for the working mathematician. Graduate Texts in Mathematics. Springer, Berlin, 1971.
• [14] J. Meseguer, U. Montanari, and V. Sassone. Process versus unfolding semantics for Place/Transition Petri nets. Theoretical Computer Science, 153(1-2):171–210, 1996.
• [15] D.Murphy. Time and duration in noninterleaving concurrency. Fundamenta Informaticae, 19(3-4):403–416, 1993.
• [16] M. Nygaard and G.Winskel. Domain theory for concurrency. Theoretical Computer Science, 316(1-3):153–190, 2004.
• [17] V. Sassone, M. Nielsen, and G. Winskel. Models for concurrency: towards a classification. Theoretical Computer Science, 170(1-2):297–348, 1996.
• [18] M.W. Shields. Concurrent Machines. The Computer Journal, 28(5):449–465, 1985.
• [19] V. Valero, D. de Frutos, and F. Cuartero. Timed processes of timed Petri nets. Lecture Notes in Computer Science, 935:490–509, 1995.
• [20] D. Varacca, H. Völzer, and G. Winskel. Probabilistic event structures and domains. Theoretical Computer Science, 358(2-3):173–199, 2006.
• [21] G. Winskel. Events in Computation. PhD thesis, University of Edingurgh, 1980.
• [22] G. Winskel. Event structures. Lecture Notes in Computer Science, 255:325–392, 1987.