Pages that link to "Item:Q1263984"

The following pages link to A complete axiomatisation for observational congruence of finite-state behaviours (Q1263984):

Displaying 50 items.

• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
• An algebra of behavioural types (Q418153) (← links)
• Timed modal logics for real-time systems. Specification, verification and control (Q548704) (← links)
• On quasi-open bisimulation (Q557789) (← links)
• A complete axiomatization of timed bisimulation for a class of timed regular behaviours (Q672231) (← links)
• Infinite normal forms for non-linear term rewriting systems (Q672235) (← links)
• Structural operational semantics for weak bisimulations (Q673123) (← links)
• Deciding observational congruence of finite-state CCS expressions by rewriting (Q673974) (← links)
• On timed alternating simulation for concurrent timed games (Q715043) (← links)
• Control of discrete-event systems with partial observations using coalgebra and coinduction (Q816696) (← links)
• Axiomatizations for probabilistic finite-state behaviors (Q875517) (← links)
• Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\) (Q893593) (← links)
• Theory of interaction (Q896903) (← links)
• Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic? (Q979076) (← links)
• Deciding bisimilarity is P-complete (Q1203120) (← links)
• An equational axiomatization for multi-exit iteration (Q1369097) (← links)
• A complete axiomatization of finite-state ACSR processes (Q1376418) (← links)
• Nonaxiomatisability of equivalences over finite state processes (Q1377607) (← links)
• A process algebra of communicating shared resources with dense time and priorities (Q1389685) (← links)
• The equational logic of fixed points (Q1391734) (← links)
• Finite axiom systems for testing preorder and De Simone process languages (Q1575273) (← links)
• The theory of interactive generalized semi-Markov processes (Q1603705) (← links)
• Hiding resources that can fail: An axiomatic perspective (Q1607106) (← links)
• Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours (Q1633345) (← links)
• Understanding the mismatch combinator in chi calculus (Q1853614) (← links)
• Tau laws for pi calculus (Q1884877) (← links)
• Inference systems for observation equivalences in the \(\pi\)-calculus (Q1974214) (← links)
• Process calculi as a tool for studying coordination, contracts and session types (Q1987732) (← links)
• A complete axiomatization of weighted branching bisimulation (Q2182679) (← links)
• Team equivalences for finite-state machines with silent moves (Q2216117) (← links)
• Priority and abstraction in process algebra (Q2381506) (← links)
• Axiomatizing weak simulation semantics over BCCSP (Q2453533) (← links)
• CCS with priority guards (Q2474050) (← links)
• Axiomatising divergence (Q2581532) (← links)
• Reactive bisimulation semantics for a process algebra with timeouts (Q2687033) (← links)
• The Value-Passing Calculus (Q2842635) (← links)
• Revisiting interactive Markov chains (Q2842864) (← links)
• Expressing priorities and external probabilities in process algebra via mixed open/closed systems (Q2864370) (← links)
• Extensions of standard weak bisimulation machinery: finite-state general processes, refinable actions, maximal-progress and time (Q2870192) (← links)
• The Equational Theory of Weak Complete Simulation Semantics over BCCSP (Q2891363) (← links)
• Axiomatizing Weak Ready Simulation Semantics over BCCSP (Q3105742) (← links)
• Up-to Techniques for Branching Bisimilarity (Q3297777) (← links)
• (Q3343432) (← links)
• Iteration Semirings (Q3532996) (← links)
• A ground-complete axiomatisation of finite-state processes in a generic process algebra (Q3545273) (← links)
• On Finite Bases for Weak Semantics: Failures Versus Impossible Futures (Q3599070) (← links)
• (Q5020941) (← links)
• Morphisms and Minimisation of Weighted Automata (Q5038573) (← links)
• (Q5089269) (← links)
• Canonical Solutions to Recursive Equations and Completeness of Equational Axiomatisations. (Q5089302) (← links)