Pages that link to "Item:Q1057072"

The following pages link to A complete inference system for a class of regular behaviours (Q1057072):

Displaying 50 items.

• A complete axiomatization of weighted branching bisimulation (Q2182679) (← links)
• Team equivalences for finite-state machines with silent moves (Q2216117) (← links)
• Team bisimilarity, and its associated modal logic, for BPP nets (Q2231652) (← links)
• Towards general axiomatizations for bisimilarity and trace semantics (Q2237336) (← links)
• Axiomatizing rational power series over natural numbers (Q2389332) (← links)
• Verification of finite-state machines: a distributed approach (Q2413026) (← links)
• Axiomatizing weighted synchronization trees and weighted bisimilarity (Q2447752) (← links)
• CCS with priority guards (Q2474050) (← links)
• Axiomatising divergence (Q2581532) (← links)
• Reactive bisimulation semantics for a process algebra with timeouts (Q2687033) (← links)
• Unique, guarded fixed points in an additive setting (Q2842814) (← links)
• (Q2842864) (← links)
• Labelled Markov Processes as Generalised Stochastic Relations (Q2864159) (← links)
• Proving the validity of equations in GSOS languages using rule-matching bisimilarity (Q2883120) (← links)
• Expressiveness modulo bisimilarity of regular expressions with parallel composition (Q2971071) (← links)
• Topological Construction of Parameterized Bisimulation Limit (Q2994479) (← links)
• The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics (Q3130301) (← links)
• Deriving Syntax and Axioms for Quantitative Regular Behaviours (Q3184671) (← links)
• CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence (Q3498448) (← links)
• Iteration Semirings (Q3532996) (← links)
• Deciding Bisimilarity of Full BPA Processes Locally (Q3540084) (← links)
• Fairness and regularity for SCCS processes (Q3816967) (← links)
• Step bisimulation is pomset equivalence on a parallel language without explicit internal choice (Q4279248) (← links)
• (Q4558787) (← links)
• Axiomatizations for the perpetual loop in process algebra (Q4571987) (← links)
• A complete proof system for Nested Term Graphs (Q4645805) (← links)
• A Finite Axiomatization of Nondeterministic Regular Expressions (Q4943553) (← links)
• (Q5014444) (← links)
• (Q5018493) (← links)
• (Q5021231) (← links)
• (Q5089269) (← links)
• Canonical Solutions to Recursive Equations and Completeness of Equational Axiomatisations. (Q5089302) (← links)
• Using Hoare Logic in a Process Algebra Setting (Q5164860) (← links)
• Causal Semantics for BPP Nets with Silent Moves (Q5164874) (← links)
• A Generic Process Algebra (Q5262952) (← links)
• Complete Axiomatization for Divergent-Sensitive Bisimulations in Basic Process Algebra with Prefix Iteration (Q5415608) (← links)
• Tree Process Calculus (Q5415625) (← links)
• Multi-Linear Iterative K-Σ-Semialgebras (Q5739356) (← links)
• Sound and Complete Axiomatization of Trace Semantics for Probabilistic Systems (Q5739363) (← links)
• Non-deterministic structures of computation (Q5740658) (← links)
• A complete axiomatisation for trace congruence of finite state behaviors (Q5890064) (← links)
• Linearization in parallel pCRL (Q5946027) (← links)
• Non-regular iterators in process algebra (Q5958616) (← links)
• An axiomatic semantics for Esterel (Q5958617) (← links)
• Infinite results (Q6104374) (← links)
• A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity (Q6135767) (← links)
• A dynamic logic with branching modalities (Q6151608) (← links)
• A complete inference system for skip-free guarded Kleene algebra with tests (Q6535242) (← links)
• Milner's proof system for regular expressions modulo bisimilarity is complete. Crystallization: near-collapsing process graph interpretations of regular expressions (Q6649466) (← links)
• On star expressions and completeness theorems (Q6653760) (← links)