Priority as extremal probability

[1]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[2]  Rance Cleaveland,et al.  A Process Algebra with Distributed Priorities , 1996, Theor. Comput. Sci..

[3]  Bernhard Steffen,et al.  Reactive, Generative and Stratified Models of Probabilistic Processes , 1995, Inf. Comput..

[4]  Rance Cleaveland,et al.  Priority and abstraction in process algebra , 1994, Inf. Comput..

[5]  Insup Lee,et al.  A Resource-Based Prioritized Bisimulation for Real-Time Systems , 1992, Inf. Comput..

[6]  Colin J. Fidge,et al.  A formal definition of priority in CSP , 1993, TOPL.

[7]  Steven M. German,et al.  Programming in a General Model of Synchronization , 1992, CONCUR.

[8]  Maciej Koutny,et al.  Petri Net Semantics of Priority Systems , 1992, Theor. Comput. Sci..

[9]  Hans A. Hansson.  Time and probability in formal design of distributed systems , 1991, DoCS.

[10]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

[11]  Glynn Winskel,et al.  CCS with priority choice , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[12]  Chris M. N. Tofts,et al.  A Synchronous Calculus of Relative Frequency , 1990, CONCUR.

[13]  Insup Lee,et al.  CCSR: A Calculus for Communicating Shared Resources , 1990, CONCUR.

[14]  Bernhard Steffen,et al.  Reactive, generative, and stratified models of probabilistic processes , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[15]  Juanito Camilleri.  Priority in process calculi , 1990 .

[16]  Scott A. Smolka,et al.  Algebraic Reasoning for Probabilistic Concurrent Systems , 1990, Programming Concepts and Methods.

[17]  Geoff Barrett.  The Semantics of Priority and Fairness in occam , 1989, Mathematical Foundations of Programming Semantics.

[18]  Kim G. Larsen,et al.  Bisimulation through probabilistic testing (preliminary report) , 1989, POPL '89.

[19]  Juanito Camilleri.  Introducing a priority operator to CCS , 1989 .

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

[21]  Rance Cleaveland,et al.  Priorities in process algebras , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[22]  Amir Pnueli,et al.  Applications of Temporal Logic to the Specification and Verification of Reactive Systems: A Survey of Current Trends , 1986, Current Trends in Concurrency.

[23]  Amir Pnueli,et al.  Linear and Branching Structures in the Semantics and Logics of Reactive Systems , 1985, ICALP.

[24]  Jan A. Bergstra,et al.  Syntax and defining equations for an interrupt mechanism in process algebra , 1985 .

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

[26]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[27]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[28]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[29]  L. Shapley,et al.  Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.

[30]  H. S. ALLEN.  Time and Probability , 1938, Nature.