Deriving Syntax and Axioms for Quantitative Regular Behaviours

DOI10.1007/978-3-642-04081-8_11zbMath1254.68129OpenAlexW2168411741MaRDI QIDQ3184671

Marcello M. Bonsangue, Filippo Bonchi, Alexandra Silva, Jan J. M. M. Rutten

Publication date: 22 October 2009

Published in: CONCUR 2009 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04081-8_11

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Abstract data types; algebraic specification (68Q65)

Related Items (4)

Complete axiomatization for the total variation distance of Markov chains ⋮ Deriving Syntax and Axioms for Quantitative Regular Behaviours ⋮ Quantitative Kleene coalgebras ⋮ A semiring-based trace semantics for processes with applications to information leakage analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hierarchy of probabilistic system types
• A complete inference system for a class of regular behaviours
• Verification of multiprocess probabilistic protocols
• Bisimulation through probabilistic testing
• CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
• CONCUR '92. 3rd international conference on concurrency theory. Stony Brook, NY, USA, August 24--27, 1992. Proceedings
• A logic for reasoning about time and reliability
• Universal coalgebra: A theory of systems
• Priority as extremal probability
• Reactive, generative, and stratified models of probabilistic processes
• Bisimulation relations for weighted automata
• Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study
• Equational Axioms for Probabilistic Bisimilarity
• Deriving Syntax and Axioms for Quantitative Regular Behaviours
• On the definition of a family of automata
• A Kleene Theorem for Polynomial Coalgebras
• Monoid-labeled transition systems
• Two Complete Axiom Systems for the Algebra of Regular Events
• Probabilistic automata
• Derivatives of Regular Expressions
• Foundations of Software Science and Computational Structures
• Automata, Languages and Programming
• A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages
• Processes, Terms and Cycles: Steps on the Road to Infinity

This page was built for publication: Deriving Syntax and Axioms for Quantitative Regular Behaviours