Pages that link to "Item:Q1079949"
From MaRDI portal
The following pages link to Higher-level synchronising devices in Meije-SCCS (Q1079949):
Displaying 50 items.
- Modelling and analysing neural networks using a hybrid process algebra (Q264526) (← links)
- Compositional semantics and behavioural equivalences for reaction systems with restriction (Q403001) (← links)
- Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity (Q418189) (← links)
- On cool congruence formats for weak bisimulations (Q549196) (← links)
- Step failures semantics and a complete proof system (Q582133) (← links)
- A process algebraic view of input/output automata (Q674195) (← links)
- Transition system specifications with negative premises (Q685387) (← links)
- The expressive power of implicit specifications (Q685409) (← links)
- Turing machines, transition systems, and interaction (Q703844) (← links)
- Synchronous Kleene algebra (Q710676) (← links)
- On Meije and SCCS: Infinite sum operators vs. non-guarded definitions (Q789888) (← links)
- Algèbre de processus et synchronisation (Q789894) (← links)
- Algebraic specification of agent computation (Q814896) (← links)
- Fair testing (Q865623) (← links)
- SOS formats and meta-theory: 20 years after (Q877025) (← links)
- A calculus and logic of bunched resources and processes (Q906271) (← links)
- Compositional semantics and behavioral equivalences for P systems (Q924685) (← links)
- Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes (Q974113) (← links)
- A precongruence format for should testing preorder (Q974134) (← links)
- Compositional semantics of spiking neural P systems (Q987958) (← links)
- Semantics and expressiveness of ordered SOS (Q1012119) (← links)
- Bialgebraic methods and modal logic in structural operational semantics (Q1012126) (← links)
- Concurrency and atomicity (Q1124366) (← links)
- Partial specifications and compositional verification (Q1177172) (← links)
- The chemical abstract machine (Q1190491) (← links)
- Experimenting with process equivalence (Q1194327) (← links)
- Structured operational semantics and bisimulation as a congruence (Q1198952) (← links)
- An algebra for process creation (Q1203719) (← links)
- A conservative look at operational semantics with variable binding (Q1273877) (← links)
- GSOS and finite labelled transition systems (Q1331924) (← links)
- When is partial trace equivalence adequate? (Q1333407) (← links)
- Automatizing parametric reasoning on distributed concurrent systems (Q1346610) (← links)
- A \(\pi\)-calculus with explicit substitutions (Q1350998) (← links)
- Finite axiom systems for testing preorder and De Simone process languages (Q1575273) (← links)
- Dynamic connectors for concurrency (Q1603689) (← links)
- Compositional SOS and beyond: A coalgebraic view of open systems (Q1603820) (← links)
- On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus (Q1641151) (← links)
- SOS specifications for uniformly continuous operators (Q1678172) (← links)
- Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity (Q1680509) (← links)
- Rule formats for distributivity (Q1758150) (← links)
- CCS with Hennessy's merge has no finite-equational axiomatization (Q1763725) (← links)
- Observational congruences for dynamically reconfigurable tile systems (Q1782000) (← links)
- Action transducers and timed automata (Q1816917) (← links)
- A comparison of Statecharts step semantics (Q1853596) (← links)
- Tile formats for located and mobile systems. (Q1854326) (← links)
- Bisimilarity of open terms. (Q1854331) (← links)
- Ordered SOS process languages for branching and eager bisimulations (Q1854563) (← links)
- Rule formats for compositional non-interference properties (Q1878717) (← links)
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation (Q1878718) (← links)
- A format for semantic equivalence comparison (Q1884897) (← links)
