The following pages link to (Q3907077):
Displaying 50 items.
- A connection between concurrency and language theory (Q265802) (← links)
- History-preserving bisimilarity for higher-dimensional automata via open maps (Q265804) (← links)
- Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey (Q271706) (← links)
- Weak bisimulations for fuzzy automata (Q279375) (← links)
- Transition systems from event structures revisited (Q293333) (← links)
- A non-SOS operational semantics for a process algebra (Q293405) (← links)
- Regularity of normed PA processes (Q294692) (← links)
- Two-thirds simulation indexes and modal logic characterization (Q352098) (← links)
- Information flow in systems with schedulers. II: Refinement (Q383362) (← links)
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- An observationally complete program logic for imperative higher-order functions (Q387994) (← links)
- A game-theoretic approach to fault diagnosis and identification of hybrid systems (Q391104) (← links)
- Theory and computation of discrete state space decompositions for hybrid systems (Q397399) (← links)
- General quantitative specification theories with modal transition systems (Q404008) (← links)
- Bisimulations for fuzzy automata (Q423147) (← links)
- Bisimilarity enforcing supervisory control for deterministic specifications (Q463845) (← links)
- A ground-complete axiomatization of stateless bisimilarity over Linda (Q477631) (← links)
- A modal characterization of alternating approximate bisimilarity (Q479808) (← links)
- Bounded semantics (Q483292) (← links)
- An intuitionistic version of Ramsey's theorem and its use in program termination (Q499082) (← links)
- Rough approximations based on bisimulations (Q505252) (← links)
- Undecidability of performance equivalence of Petri nets (Q507373) (← links)
- Computing maximal weak and other bisimulations (Q510897) (← links)
- Automatic distributed code generation from formal models of asynchronous processes interacting by multiway rendezvous (Q516036) (← links)
- On bisimulations for description logics (Q527171) (← links)
- Simulation refinement for concurrency verification (Q541209) (← links)
- On the axiomatizability of priority. II (Q549169) (← links)
- SOS rule formats for zero and unit elements (Q549170) (← links)
- Modal logics for communicating systems (Q578896) (← links)
- Prespecification in data refinement (Q578901) (← links)
- An intensional characterization of the largest bisimulation (Q580963) (← links)
- Automata on infinite objects and their applications to logic and programming (Q582913) (← links)
- Bisimulation on speed: Worst-case efficiency (Q598200) (← links)
- Nested semantics over finite trees are equationally hard (Q598202) (← links)
- Algebraic notions of nontermination: Omega and divergence in idempotent semirings (Q604456) (← 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)
- Generalising Conduché's theorem (Q633801) (← links)
- Coalgebras in functional programming and type theory (Q639643) (← links)
- Extensional Petri net (Q667521) (← links)
- Literal shuffle on \(\omega\)-languages (Q671414) (← links)
- Modelling causality via action dependencies in branching time semantics (Q671596) (← links)
- Location equivalence in a parametric setting (Q672708) (← links)
- Late and early semantics coincide for testing (Q673146) (← links)
- On the implementation of concurrent calculi in net calculi: two case studies (Q673785) (← links)
- A theory of processes with durational actions (Q674005) (← links)
- Logical characterizations of simulation and bisimulation for fuzzy transition systems (Q679804) (← links)
- Analysis of the structure of attributed transition systems without hidden transitions (Q681892) (← links)
- Transition system specifications with negative premises (Q685387) (← links)
- Bisimulation and action refinement (Q685407) (← links)
