Complete proof systems for weighted modal logic

[1]  Kim G. Larsen,et al.  Stone Duality for Markov Processes , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[2]  Kim G. Larsen,et al.  Continuous Markovian Logics - Axiomatization and Quantified Metatheory , 2012, Log. Methods Comput. Sci..

[3]  Robert Goldblatt,et al.  Topological Proofs of Some Rasiowa-Sikorski Lemmas , 2012, Stud Logica.

[4]  Kim G. Larsen,et al.  Continuous Markovian Logic - From Complete Axiomatization to the Metric Space of Formulas , 2011, CSL.

[5]  Chunlai Zhou,et al.  Intuitive Probability Logic , 2011, TAMC.

[6]  Robert Goldblatt,et al.  Deduction Systems for Coalgebras Over Measurable Spaces , 2010, J. Log. Comput..

[7]  Chunlai Zhou,et al.  A Complete Deductive System for Probability Logic , 2009, J. Log. Comput..

[8]  M. Droste,et al.  Handbook of Weighted Automata , 2009 .

[9]  George J. Pappas,et al.  Optimal Paths in Weighted Timed Automata , 2001, HSCC.

[10]  Kim G. Larsen,et al.  Minimum-Cost Reachability for Priced Timed Automata , 2001, HSCC.

[11]  Igor Walukiewicz,et al.  Completeness of Kozen's axiomatisation of the propositional /spl mu/-calculus , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[12]  G. Winskel,et al.  A Compositional Proof System for the Modal mu-Calculus , 1994 .

[13]  Glynn Winskel,et al.  A compositional proof system for the modal /spl mu/-calculus , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[14]  Bernhard Steffen,et al.  Characteristic Formulae for Processes with Divergence , 1994, Inf. Comput..

[15]  Rance Cleaveland,et al.  A linear-time model-checking algorithm for the alternation-free modal mu-calculus , 1993, Formal Methods Syst. Des..

[16]  K. Larsen,et al.  Computer Aided Verification: 3rd International Workshop, CAV '91, Aalborg, Denmark, July 1-4, 1991. Proceedings , 1992, CAV 1992.

[17]  David Walker,et al.  Local Model Checking in the Modal mu-Calculus , 1991, Theor. Comput. Sci..

[18]  Rance Cleaveland,et al.  Computing Behavioural Relations, Logically , 1991, ICALP.

[19]  Glynn Winskel,et al.  Compositional checking of satisfaction , 1991, Formal Methods Syst. Des..

[20]  Glynn Winskel,et al.  A Note on Model Checking the Modal nu-Calculus , 1991, Theor. Comput. Sci..

[21]  Kim G. Larsen,et al.  Ideal Specification Formalism + Expressivity + Compositionality + Decidability + Testability + , 1990, CONCUR.

[22]  Xinxin Liu,et al.  Compositionality through an Operational Semantics of Contexts , 1990, J. Log. Comput..

[23]  R. Alur,et al.  Automata For Modeling Real-Time Systems , 1990, ICALP.

[24]  Giorgio Ausiello,et al.  Automata, Languages, and Programming: 16th International Colloquium Stresa, Italy, July 11-15, 1989 Proceedings , 1989 .

[25]  B. Steffen.  Characteristic Formulae , 1989, ICALP.

[26]  Kim G. Larsen,et al.  Proof System for Hennessy-Milner Logic with Recursion , 1988, CAAP.

[27]  Glynn Winskel,et al.  A Complete System for SCCS with Modal Assertions , 1985, FSTTCS.

[28]  Glynn Winskel,et al.  Seminar on Concurrency: Carnegie-Mellon University Pittsburgh, PA, July 9-11, 1984 , 1985 .

[29]  Glynn Winskel,et al.  On the Composition and Decomposition of Assertions , 1984, Seminar on Concurrency.

[30]  Dexter Kozen,et al.  Results on the Propositional µ-Calculus , 1982, ICALP.

[31]  K. Larsen.  Context-dependent bisimulation between processes , 1986 .

[32]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[33]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

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

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