Modeling concurrent real-time processes using discrete events

We give a formal framework for studying real-time discrete-event systems. It describes concurrent processes as sets of possible behaviors. Compositions of processes are processes with behaviors in the intersection of the behaviors of the component processes. The interaction between processes is through signals, which are collections of events. Each event is a value-tag pair, where the tags denote time. Zeno conditions are defined and methods are given for avoiding them. Strict causality ensures determinacy under certain technical conditions, and delta-causality ensures the absence of Zeno conditions.

[1]  Yu-Chi Ho,et al.  Discrete event dynamic systems : analyzing complexity and performance in the modern world , 1992 .

[2]  Edwin K. P. Chong,et al.  Discrete event systems: Modeling and performance analysis , 1994, Discret. Event Dyn. Syst..

[3]  Rajagopal Nagarajan,et al.  Interaction categories and the foundations of typed concurrent programming , 1996, NATO ASI DPD.

[4]  Colin J. Fidge,et al.  Logical time in distributed computing systems , 1991, Computer.

[5]  A. W. Roscoe,et al.  Metric Spaces as Models for Real-Time Concurrency , 1987, MFPS.

[6]  Stephen A. Edwards,et al.  The specification and execution of heterogeneous synchronous reactive systems , 1998 .

[7]  S. G. Matthews,et al.  Partial Metric Topology , 1994 .

[8]  Edward A. Lee,et al.  A DENOTATIONAL FRAMEWORK FOR COMPARING MODELS OF COMPUTATION , 1997 .

[9]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[10]  Thomas A. Henzinger,et al.  Real-time system = discrete system + clock variables , 1994, International Journal on Software Tools for Technology Transfer.

[11]  Albert Benveniste,et al.  The synchronous approach to reactive and real-time systems , 1991 .

[12]  Antoni W. Mazurkiewicz,et al.  Traces, Histories, Graphs: Instances of a Process Monoid , 1984, International Symposium on Mathematical Foundations of Computer Science.

[13]  lawa Kanas,et al.  Metric Spaces , 2020, An Introduction to Functional Analysis.

[14]  R. K. Yates,et al.  Networks of Real-Time Processes , 1993, CONCUR.

[15]  R. J. Kulpinski,et al.  Dissemination of System Time , 1973, IEEE Trans. Commun..

[16]  David G. Messerschmitt,et al.  Synchronization in Digital System Design , 1990, IEEE J. Sel. Areas Commun..

[17]  A. Benveniste.  Compositional and uniform modeling of hybrid systems , 1998 .

[18]  S. G. Matthews,et al.  An Extensional Treatment of Lazy Data Flow Deadlock , 1995, Theor. Comput. Sci..

[19]  Manfred Broy,et al.  Functional specification of time-sensitive communicating systems , 1993, TSEM.

[20]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[21]  Mukesh Singhal,et al.  Logical Time: Capturing Causality in Distributed Systems , 1996, Computer.

[22]  Garrett Birkhoff,et al.  A survey of modern algebra , 1942 .

[23]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[24]  Christos G. Cassandras,et al.  Discrete event systems : modeling and performance analysis , 1993 .

[25]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.