A Denotational Model for Probabilistic and Nondeterministic Processes
暂无分享,去创建一个
Valentín Valero Ruiz | Diego Cazorla | Fernando López Pelayo | Fernando Cuartero | F. L. Pelayo | F. Cuartero | D. Cazorla | V. V. Ruiz
[1] Nancy A. Lynch,et al. Probabilistic Simulations for Probabilistic Processes , 1994, Nord. J. Comput..
[2] Matthew Hennessy,et al. Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.
[3] Roberto Segala,et al. Modeling and verification of randomized distributed real-time systems , 1996 .
[4] N. Saheb-Djahromi,et al. CPO'S of Measures for Nondeterminism , 1980, Theor. Comput. Sci..
[5] G. Winskel. The formal semantics of programming languages , 1993 .
[6] C.-H. Luke Ong. Correspondence between Operational and Denotational Semantics , 1995, LICS 1995.
[7] Glynn Winskel,et al. A Note on Powerdomains and Modalitiy , 1983, FCT.
[8] Eugenio Moggi,et al. Notions of Computation and Monads , 1991, Inf. Comput..
[9] Kim G. Larsen,et al. Bisimulation through Probabilistic Testing , 1991, Inf. Comput..
[10] Valentín Valero Ruiz,et al. TPAL: a timed-probabilistic model for concurrent processes , 1997, Proceedings of Joint 4th International Computer Science Conference and 4th Asia Pacific Software Engineering Conference.
[11] R. Lathe. Phd by thesis , 1988, Nature.
[12] Suzana Andova,et al. Process Algebra with Probabilistic Choice , 1999, ARTS.
[13] Marcelo P Fiore,et al. Topology via Logic , 1999 .
[14] Scott A. Smolka,et al. Algebraic Reasoning for Probabilistic Concurrent Systems , 1990, Programming Concepts and Methods.
[15] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .
[16] Bernhard Steffen,et al. Reactive, Generative and Stratified Models of Probabilistic Processes , 1995, Inf. Comput..
[17] Regina Tix,et al. Continuous D-cones: convexity and powerdomain constructions , 1999 .
[18] Marta Z. Kwiatkowska,et al. A Testing Equivalence for Reactive Probabilistic Processes , 1998, EXPRESS.
[19] Amir Pnueli,et al. Probabilistic Verification , 1993, Information and Computation.
[20] Gordon D. Plotkin,et al. Notions of Computation Determine Monads , 2002, FoSSaCS.
[21] Hagen Völzer. Randomized Non-sequential Processes , 2001, CONCUR.
[22] Jan J. M. M. Rutten,et al. Initial Algebra and Final Coalgebra Semantics for Concurrency , 1993, REX School/Symposium.
[23] Wang Yi,et al. Compositional testing preorders for probabilistic processes , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.
[24] Michael W. Mislove. Nondeterminism and Probabilistic Choice: Obeying the Laws , 2000, CONCUR.
[25] Glynn Winskel,et al. Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..
[26] Wang Yi,et al. Testing Probabilistic and Nondeterministic Processes , 1992, PSTV.
[27] David de Frutos-Escrig,et al. A Sound and Complete Proof System for Probabilistic Processes , 1997, ARTS.
[28] Bengt Jonsson,et al. A calculus for communicating systems with time and probabilities , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.
[29] Manuel Núñez,et al. Acceptance Trees for Probabilistic Processes , 1995, CONCUR.
[30] Gavin Lowe,et al. Representing Nondeterministic and Probabilistic Behaviour in Reactive Processes , 1993 .
[31] Michael B. Smyth,et al. Power Domains and Predicate Transformers: A Topological View , 1983, ICALP.
[32] Karen Seidel,et al. Probabilistic Communicating Processes , 1992, Theor. Comput. Sci..
[33] Moshe Y. Vardi. Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[34] Gordon D. Plotkin,et al. A Powerdomain Construction , 1976, SIAM J. Comput..
[35] Mariëlle Stoelinga,et al. An Introduction to Probabilistic Automata , 2002, Bull. EATCS.
[36] Glynn Winskel,et al. Event Structure Semantics for CCS and Related Languages , 1982, ICALP.
[37] Glynn Winskel,et al. Events in computation , 1980 .
[38] Grzegorz Rozenberg,et al. Petri Nets: Basic Notions, Structure, Behaviour , 1986, Current Trends in Concurrency.
[39] Scott A. Smolka,et al. Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes , 1990, CONCUR.
[40] Mogens Nielsen,et al. Models for Concurrency , 1992 .
[41] Daniele Varacca,et al. The powerdomain of indexed valuations , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.
[42] Albert R. Meyer,et al. A Remark on Bisimulation Between Probabilistic Processes , 1989, Logic at Botik.
[43] Regina Tix. Convex power constructions for continuous d-cones , 2000, Electron. Notes Theor. Comput. Sci..
[44] Christopher Strachey,et al. Toward a mathematical semantics for computer languages , 1971 .