Pages that link to "Item:Q918211"
From MaRDI portal
The following pages link to CCS expressions, finite state processes, and three problems of equivalence (Q918211):
Displaying 50 items.
- Deciding probabilistic automata weak bisimulation: theory and practice (Q282105) (← links)
- An improvement of algorithms for solving interface equations (Q293354) (← links)
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- A coalgebraic perspective on linear weighted automata (Q418134) (← links)
- Bisimulations for fuzzy automata (Q423147) (← links)
- Modal transition systems with weight intervals (Q444490) (← links)
- Model-checking process equivalences (Q477208) (← links)
- A succinct canonical register automaton model (Q478388) (← links)
- On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi (Q481103) (← links)
- Polynomial time decision algorithms for probabilistic automata (Q498403) (← links)
- Metrics for weighted transition systems: axiomatization and complexity (Q549202) (← links)
- Nested semantics over finite trees are equationally hard (Q598202) (← links)
- Weak bisimulation for probabilistic timed automata (Q606996) (← links)
- Translating FSP into LOTOS and networks of automata (Q613134) (← links)
- On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations (Q622073) (← links)
- Weighted o-minimal hybrid systems (Q636266) (← links)
- Deciding bisimulation and trace equivalences for systems with many identical processes (Q672063) (← links)
- EXPTIME-completeness of thorough refinement on modal transition systems (Q690504) (← links)
- Computation of the greatest simulations and bisimulations between fuzzy automata (Q690916) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Reduction of fuzzy automata by means of fuzzy quasi-orders (Q726556) (← links)
- Priorities in process algebras (Q802881) (← links)
- SOS formats and meta-theory: 20 years after (Q877025) (← links)
- A coalgebraic semantics for causality in Petri nets (Q890619) (← links)
- Nondeterministic automata: equivalence, bisimulations, and uniform relations (Q903611) (← links)
- Contract-based discovery of Web services modulo simple orchestrators (Q987977) (← links)
- Fuzzy relation equations and reduction of fuzzy automata (Q988575) (← links)
- (Bi)simulations up-to characterise process semantics (Q1012122) (← links)
- Hardness of equivalence checking for composed finite-state systems (Q1015390) (← links)
- The parallel complexity of coarsest set partition problems (Q1198030) (← links)
- Deciding bisimilarity is P-complete (Q1203120) (← links)
- A process algebra with distributed priorities (Q1276244) (← links)
- Exact performance equivalence: An equivalence relation for stochastic automata (Q1285589) (← links)
- On deciding trace equivalences for processes (Q1310916) (← links)
- Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\) (Q1314379) (← links)
- Proving finiteness of CCS processes by non-standard semantics (Q1323345) (← links)
- An exercise in the automatic verification of asynchronous designs (Q1329086) (← links)
- A note on the complexity of deciding bisimilarity of normed unary processes (Q1331934) (← links)
- Time-abstracted bisimulation: Implicit specifications and decidability (Q1363777) (← links)
- Deciding true concurrency equivalences on safe, finite nets (Q1365677) (← links)
- Complexity of equivalence problems for concurrent systems of finite agents (Q1383143) (← links)
- On the decidability of process equivalences for the \(\pi\)-calculus (Q1391099) (← links)
- Undecidability of domino games and hhp-bisimilarity. (Q1401953) (← links)
- A complexity analysis of bisimilarity for value-passing processes (Q1575255) (← links)
- Operational and abstract semantics of the query language G-Log (Q1607222) (← links)
- Constructive logical characterizations of bisimilarity for reactive probabilistic systems (Q1731513) (← links)
- Applying model-checking to solve queries on semistructured data (Q1749228) (← links)
- The quest for minimal quotients for probabilistic and Markov automata (Q1784955) (← links)
- On the metric-based approximate minimization of Markov chains (Q1785848) (← links)
- An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation (Q1785863) (← links)
