The Influence of Durational Actions on Time Equivalences

The hierarchy of untimed equivalences is well understood for action-based systems. This is not the case for timed systems, where it is, for example, possible to detect concurrency by single timed action execution. To clarify the connection between equivalences in timed systems, a timed version of configuration structures is introduced together with timed equivalence notions adapted from untimed equivalences. There actions (events) have an occurrence time and a duration. The result of this paper is that all timed versions of the equivalences from [15] have the same relative discriminating power as in the untimed case, except that interleaving and step (for trace and bisimulation) equivalences coincide if systems are considered where every action must have a positive duration.

[1]  Lucia Pomello,et al.  Some equivalence notions for concurrent systems. An overview , 1985, Applications and Theory in Petri Nets.

[2]  Alex K. Simpson,et al.  Compositionality via cut-elimination: Hennessy-Milner logic for an arbitrary GSOS , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[3]  Glynn Winskel,et al.  An introduction to event structures , 1988, REX Workshop.

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

[5]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum I , 2001, Handbook of Process Algebra.

[6]  Marco Roccetti,et al.  A Theory of Processes with Durational Actions , 1995, Theor. Comput. Sci..

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

[8]  Flavio Corradini,et al.  Absolute versus relative time in process algebras , 1999, EXPRESS.

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

[10]  R. V. Glabbeek.  CHAPTER 1 – The Linear Time - Branching Time Spectrum I.* The Semantics of Concrete, Sequential Processes , 2001 .

[11]  J. Davenport.  Editor , 1960 .

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

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

[14]  Wang Yi,et al.  CCS + Time = An Interleaving Model for Real Time Systems , 1991, ICALP.

[15]  Gordon D. Plotkin,et al.  Configuration structures , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[16]  Jan A. Bergstra,et al.  Process Algebra with Recursive Operations , 2001, Handbook of Process Algebra.

[17]  David Murphy,et al.  On the Ill-Timed but Well-Caused , 1993, CONCUR.

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

[19]  Rob J. van Glabbeek,et al.  Petri Net Models for Algebraic Theories of Concurrency , 1987, PARLE.

[20]  R. V. Glabbeek.  The Linear Time - Branching Time Spectrum II: The Semantics of Sequential Systems with Silent Moves , 1993 .

[21]  Rocco De Nicola,et al.  Observational equivalences for concurrency models , 1987, Formal Description of Programming Concepts.

[22]  Xiao Jun Chen,et al.  On the Specification and Verification of Performance Properties for a Timed Process Algebra , 1997, AMAST.

[23]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

[24]  Ursula Goltz,et al.  Refinement of actions and equivalence notions for concurrent systems , 2001, Acta Informatica.

[25]  Matthew Hennessy,et al.  The Power of the Future Perfect in Program Logics , 1984, Inf. Control..

[26]  Harald Fecher,et al.  A completed hierarchy of true concurrent equivalences , 2004, Inf. Process. Lett..

[27]  Ilaria Castellani,et al.  On the Semantics of Concurrency: Partial Orders and Transition Systems , 1987, TAPSOFT, Vol.1.

[28]  Arend Rensink,et al.  Action Refinement , 1999, Handbook of Process Algebra.

[29]  A. J. Nijman,et al.  PARLE Parallel Architectures and Languages Europe , 1987, Lecture Notes in Computer Science.

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

[31]  Rob van Glabbeek,et al.  Handbook of Process Algebra , 2001 .

[32]  Grzegorz Rozenberg,et al.  Advances in Petri Nets 1985 , 1985, Lecture Notes in Computer Science.

[33]  Ursula Goltz,et al.  Refinement of Actions in Causality Based Models , 1990, REX Workshop.