Proceedings on Theories of concurrency : unification and extension: unification and extension
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Bisimulation through probabilistic testing
Information and Computation
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Derivatives of Regular Expressions
Journal of the ACM (JACM)
Two Complete Axiom Systems for the Algebra of Regular Events
Journal of the ACM (JACM)
A complete axiom system for finite-state probabilistic processes
Proof, language, and interaction
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Proceedings of the Third International Conference on Concurrency Theory
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Quantifying the Dynamic Behavior of Process Algebras
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Equational Axioms for Probabilistic Bisimilarity
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Axiomatizations for Probabilistic Bisimulation
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Priority as Extremal Probability
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Compositional Verification of Probabilistic Processes
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract)
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Probabilistic Simulations for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
A hierarchy of probabilistic system types
Theoretical Computer Science - Selected papers of CMCS'03
Approximating and computing behavioural distances in probabilistic transition systems
Theoretical Computer Science
Bisimulation relations for weighted automata
Theoretical Computer Science
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
An Algebra for Kripke Polynomial Coalgebras
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Proceedings of the 20th International Conference on Concurrency Theory
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Deriving Syntax and Axioms for Quantitative Regular Behaviours
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Weighted Bisimulation in Linear Algebraic Form
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Coalgebraic foundations of linear systems
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Coalgebraic logic and synthesis of mealy machines
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Structural operational semantics for weighted transition systems
Semantics and algebraic specification
CIRC: a behavioral verification tool based on circular coinduction
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Weighted automata and weighted logics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Axiomatizations for probabilistic finite-state behaviors
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Compositional reasoning for probabilistic finite-state behaviors
Processes, Terms and Cycles
The microcosm principle and compositionality of GSOS-based component calculi
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Sound and Complete Axiomatization of Trace Semantics for Probabilistic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards linear algebras of components
FACS'10 Proceedings of the 7th international conference on Formal Aspects of Component Software
A probabilistic kleene theorem
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Sound and Complete Axiomatizations of Coalgebraic Language Equivalence
ACM Transactions on Computational Logic (TOCL)
A parameterized graph transformation calculus for finite graphs with monadic branches
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Typing linear algebra: A biproduct-oriented approach
Science of Computer Programming
| Hi-index | 0.00 |
We present a systematic way to generate (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of quantitative systems. Our quantitative systems include weighted versions of automata and transition systems, in which transitions are assigned a value in a monoid that represents cost, duration, probability, etc. Such systems are represented as coalgebras and (1) and (2) above are derived in a modular fashion from the underlying (functor) type of these coalgebras. In previous work, we applied a similar approach to a class of systems (without weights) that generalizes both the results of Kleene (on rational languages and DFA's) and Milner (on regular behaviours and finite LTS's), and includes many other systems such as Mealy and Moore machines. In the present paper, we extend this framework to deal with quantitative systems. As a consequence, our results now include languages and axiomatizations, both existing and new ones, for many different kinds of probabilistic systems.