Open Maps and Trace Semantics for Timed Partial Order Models

The intention of the paper is to show the applicability of the general categorical framework of open maps to the setting of partial order models with a dense time domain. In particular, we define a category of timed event structures, where the morphisms are to be thought of as simulations, and an accompanying (sub)category of timed pomsets which provides us with a notion of open maps. Then, we show that the abstract equivalence obtained from the framework of open maps coincides with a timed extension of the well-known trace equivalence based on Pratt’s partial orders.

[1]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[2]  Mogens Nielsen,et al.  Obseving Behaviour Categorically , 1995, FSTTCS.

[3]  Diego Latella,et al.  On Specifying Real-Time Systems in a Causality-Based Setting , 1996, FTRTFT.

[4]  Grzegorz Rozenberg,et al.  Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency , 1988, Lecture Notes in Computer Science.

[5]  Rajeev Alur,et al.  The Theory of Timed Automata , 1991, REX Workshop.

[6]  Petr Hájek,et al.  Mathematical Foundations of Computer Science 1995 , 1995, Lecture Notes in Computer Science.

[7]  Irina Virbitskaite Observational Semantics for Timed Event Structures , 2001, Ershov Memorial Conference.

[8]  David Murphy,et al.  Time and Duration in Nininterleaving Concurrency , 1993, Fundam. Informaticae.

[9]  Grzegorz Rozenberg,et al.  Real-Time: Theory in Practice: Rex Workshop, Mook, the Netherlands, June 3-7, 1991: Proceedings , 1992 .

[10]  Ursula Goltz,et al.  Causal Testing , 1996, MFCS.

[11]  Carsten Weise,et al.  Efficient Scaling-Invariant Checking of Timed Bisimulation , 1997, STACS.

[12]  Karlis Cerans,et al.  Decidability of Bisimulation Equivalences for Parallel Timer Processes , 1992, CAV.

[13]  Andrzej M. Borzyszkowski Mathematical Foundations of Computer Science 1996 , 1996 .

[14]  Christel Baier,et al.  Metric Semantics for True Concurrent Real Time , 1998, ICALP.

[15]  Wang Yi,et al.  Partial Order Reductions for Timed Systems , 1998, CONCUR.

[16]  Rajeev Alur,et al.  Model-Checking in Dense Real-time , 1993, Inf. Comput..

[17]  Mogens Nielsen,et al.  Models for Concurrency , 1992 .

[18]  Glynn Winskel,et al.  Bisimulation from Open Maps , 1994, Inf. Comput..

[19]  Thomas A. Henzinger,et al.  Timed Transition Systems , 1991, REX Workshop.

[20]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[21]  Glynn Winskel,et al.  An Introduction to Event Structures , 1989 .

[22]  Mogens Nielsen,et al.  Timed Bisimulation and Open Maps , 1998, MFCS.

[23]  Joost-Pieter Katoen,et al.  A probabilistic extension of UML statecharts: Specification and Verification. , 2002 .

[24]  Irina Virbitskaite,et al.  Analysis of Timed Concurrent Models Based on Testing Equivalence , 2000, Fundam. Informaticae.

[25]  Manfred Broy,et al.  Perspectives of System Informatics , 2001, Lecture Notes in Computer Science.

[26]  Jozef Gruska,et al.  Mathematical Foundations of Computer Science 1998 , 1998, Lecture Notes in Computer Science.

[27]  Kim Guldstrand Larsen,et al.  From Timed Automata to Logic - and Back , 1995 .

[28]  Vaughan R. Pratt,et al.  Modeling concurrency with partial orders , 1986, International Journal of Parallel Programming.

[29]  Andrea Maggiolo-Schettini,et al.  Towards an Algebra for Timed Behaviours , 1992, Theor. Comput. Sci..

[30]  Robert de Simone,et al.  CONCUR'98 Concurrency Theory , 1998, Lecture Notes in Computer Science.