Fundamentals of modelling concurrency using discrete relational structures
暂无分享,去创建一个
[1] Tomasz Müldner,et al. On the Algorithmic Properties of Concurrent Programs , 1979, Logic of Programs.
[2] E. Szpilrajn. Sur l'extension de l'ordre partiel , 1930 .
[3] P. Fishburn. Intransitive indifference with unequal indifference intervals , 1970 .
[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] Leslie Lamport,et al. The mutual exclusion problem: part I—a theory of interprocess communication , 1986, JACM.
[6] Rob J. van Glabbeek,et al. Petri Net Models for Algebraic Theories of Concurrency , 1987, PARLE.
[7] Wolfgang Reisig. Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.
[8] Maciej Koutny,et al. Order Structures and Generalisations of Szpilrajn's Theorem , 1993, FSTTCS.
[9] Gunther Schmidt,et al. Relations and Graphs , 1993, EATCS Monographs on Theoretical Computer Science.
[10] Maciej Koutny,et al. Structure of Concurrency , 1991, Theor. Comput. Sci..
[11] A. J. Nijman,et al. PARLE Parallel Architectures and Languages Europe , 1987, Lecture Notes in Computer Science.
[12] Walter Vogler. Failures Semantics Based on Interval Semiwords is a Congruence for Refinement , 1990, STACS.
[13] Maciej Koutny,et al. Deriving Histories of Nets with Priority Relation , 1994, PARLE.
[14] Roland Fraïssé. Theory of relations , 1986 .
[15] Doron A. Peled,et al. Interleaving set temporal logic , 1987, PODC '87.
[16] Haim Gaifman,et al. Partial Order Models of Concurrency and the Computation of Functions , 1987, LICS.
[17] Erwin Engeler,et al. Logic of Programs , 1981, Lecture Notes in Computer Science.
[18] Grzegorz Rozenberg,et al. Subset Languages of Petri Nets , 1982, European Workshop on Applications and Theory of Petri Nets.
[19] James Lyle Peterson,et al. Petri net theory and the modeling of systems , 1981 .
[20] Maciej Koutny,et al. Representations of Discrete Interval Orders and Semi-Orders , 1994, J. Inf. Process. Cybern..
[21] Eike Best,et al. Nonsequential Processes: A Petri Net View , 1988 .
[22] Maciej Koutny,et al. Petri Net Semantics of Priority Systems , 1992, Theor. Comput. Sci..
[23] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.
[24] Kim S. Larsen,et al. Fully abstract models for a process language with refinement , 1988, REX Workshop.
[25] Maciej Koutny,et al. Invariants and paradigms of concurrency theory , 1991, Future Gener. Comput. Syst..
[26] Wolfgang Reisig,et al. Petri Nets: Applications and Relationships to Other Models of Concurrency , 1986, Lecture Notes in Computer Science.
[27] Gunther Schmidt,et al. Discrete ordering relations , 1983, Discret. Math..
[28] Raymond R. Devillers,et al. Sequential and Concurrent Behaviour in Petri Net Theory , 1987, Theor. Comput. Sci..
[29] Insup Lee,et al. A Resource-Based Prioritized Bisimulation for Real-Time Systems , 1992, Inf. Comput..
[30] Maciej Koutny,et al. Semantics of Inhibitor Nets , 1995, Inf. Comput..
[31] Antoni W. Mazurkiewicz,et al. Trace Theory , 1986, Advances in Petri Nets.
[32] Frank D. Anger,et al. On Lamport's interprocessor communication model , 1989, TOPL.
[33] Ryszard Janicki,et al. Specification and Analysis of Concurrent Systems: The Cosy Approach , 1992 .
[34] Gordon D. Plotkin,et al. Teams can see pomsets , 1996, Partial Order Methods in Verification.
[35] Shai Ben-David,et al. On Global-Time and Inter-process Communication , 1990 .