Pages that link to "Item:Q1057072"
From MaRDI portal
The following pages link to A complete inference system for a class of regular behaviours (Q1057072):
Displaying 50 items.
- Two-thirds simulation indexes and modal logic characterization (Q352098) (← links)
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- Quantitative Kleene coalgebras (Q532394) (← links)
- Metrics for weighted transition systems: axiomatization and complexity (Q549202) (← links)
- On quasi-open bisimulation (Q557789) (← links)
- From regular expressions to deterministic automata (Q580983) (← links)
- Bisimulation on speed: Worst-case efficiency (Q598200) (← links)
- A complete axiomatization of timed bisimulation for a class of timed regular behaviours (Q672231) (← links)
- On the implementation of concurrent calculi in net calculi: two case studies (Q673785) (← links)
- The expressive power of implicit specifications (Q685409) (← links)
- Axiomatizations for probabilistic finite-state behaviors (Q875517) (← links)
- Revisiting sequential composition in process calculi (Q890611) (← links)
- Theory of interaction (Q896903) (← links)
- CCS expressions, finite state processes, and three problems of equivalence (Q918211) (← links)
- Compositional semantics and behavioral equivalences for P systems (Q924685) (← links)
- Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic? (Q979076) (← links)
- Generating priority rewrite systems for OSOS process languages (Q1012121) (← links)
- A note on an expressiveness hierarchy for multi-exit iteration (Q1014386) (← links)
- Calculi for synchrony and asynchrony (Q1050111) (← links)
- Axiomatising finite delay operators (Q1055190) (← links)
- Higher-level synchronising devices in Meije-SCCS (Q1079949) (← links)
- A context dependent equivalence between processes (Q1088404) (← links)
- The equational theory of pomsets (Q1119012) (← links)
- Algebraic and fixed point equations over inverse limits of algebras (Q1177146) (← links)
- Submodule construction as equation solving in CCS (Q1262748) (← links)
- A complete axiomatisation for observational congruence of finite-state behaviours (Q1263984) (← links)
- A complete equational axiomatization for MPA with string iteration (Q1274456) (← links)
- Group axioms for iteration (Q1283821) (← links)
- Combinatory reduction systems: Introduction and survey (Q1314356) (← links)
- A complete equational axiomatization for prefix iteration (Q1342264) (← links)
- Linear time and branching time semantics for recursion with merge (Q1348527) (← 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)
- The equational logic of fixed points (Q1391734) (← links)
- A general conservative extension theorem in process algebras with inequalities (Q1391791) (← links)
- Process algebra with propositional signals (Q1391792) (← links)
- Termination modulo equations by abstract commutation with an application to iteration (Q1391793) (← links)
- An axiomatic semantics for the synchronous language Gentzen. (Q1400575) (← links)
- Nondeterministic regular expressions as solutions of equational systems. (Q1401324) (← links)
- Finite axiom systems for testing preorder and De Simone process languages (Q1575273) (← links)
- A brief history of process algebra (Q1781995) (← links)
- Understanding the mismatch combinator in chi calculus (Q1853614) (← links)
- Bisimilarity of open terms. (Q1854331) (← links)
- Efficient and flexible matching of recursive types (Q1854490) (← links)
- Rule formats for compositional non-interference properties (Q1878717) (← links)
- Tau laws for pi calculus (Q1884877) (← links)
- A study on team bisimulation and H-team bisimulation for BPP nets (Q2055961) (← links)
- Complete axiomatization for the total variation distance of Markov chains (Q2130580) (← links)
- Axiomatizing recursion-free, regular monitors (Q2141297) (← links)
