Weighted Branching Systems: Behavioural Equivalence, Behavioural Distance, and Their Logical Characterisations

[1]  Mathias Claus Jensen,et al.  Weighted Branching Systems : Behavioural Equivalence , Metric Structure , and their Characterisations Mathias Claus Jensen ? , 2018 .

[2]  Kim G. Larsen,et al.  Weighted Branching Simulation Distance for Parametric Weighted Kripke Structures , 2016, Cassting/SynCoP.

[3]  K. Larsen,et al.  Logical Characterization and Complexity of Weighted Branching Preorders and Distances , 2016 .

[4]  Kim G. Larsen,et al.  Parametric Verification of Weighted Systems , 2015, SynCoP.

[5]  Kim G. Larsen,et al.  Efficient model-checking of weighted CTL with upper-bound constraints , 2016, International Journal on Software Tools for Technology Transfer.

[6]  Kim G. Larsen,et al.  Taking It to the Limit: Approximate Reasoning for Markov Processes , 2012, MFCS.

[7]  Kim G. Larsen,et al.  Distances for Weighted Transition Systems: Games and Properties , 2011, QAPL.

[8]  Kim G. Larsen,et al.  Metrics for weighted transition systems: Axiomatization and complexity , 2011, Theor. Comput. Sci..

[9]  Kim G. Larsen,et al.  Quantitative analysis of weighted transition systems , 2010, J. Log. Algebraic Methods Program..

[10]  Peter Buchholz,et al.  Model Checking for a Class of Weighted Automata , 2003, Discret. Event Dyn. Syst..

[11]  Frank Wolter,et al.  Handbook of Modal Logic , 2007, Studies in logic and practical reasoning.

[12]  Matti Nykänen,et al.  The Exact Path Length Problem , 2002, J. Algorithms.

[13]  Radha Jagadeesan,et al.  Metrics for Labeled Markov Systems , 1999, CONCUR.

[14]  Rocco De Nicola,et al.  Three logics for branching bisimulation , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

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

[16]  Rob J. van Glabbeek,et al.  Branching Time and Abstraction in Bisimulation Semantics (Extended Abstract) , 1989, IFIP Congress.

[17]  Edmund M. Clarke,et al.  Characterizing Finite Kripke Structures in Propositional Temporal Logic , 1988, Theor. Comput. Sci..

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

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

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