Pages that link to "Item:Q1188866"
From MaRDI portal
The following pages link to CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings (Q1188866):
Displaying 38 items.
- A ground-complete axiomatization of stateless bisimilarity over Linda (Q477631) (← links)
- Quantitative Kleene coalgebras (Q532394) (← links)
- Metrics for labelled Markov processes (Q596029) (← links)
- Confluence for process verification (Q672042) (← links)
- Probabilistic communicating processes (Q672230) (← links)
- A complete axiomatization of timed bisimulation for a class of timed regular behaviours (Q672231) (← links)
- Duplication of constants in process algebra (Q864505) (← links)
- Execution architectures for program algebra (Q881834) (← links)
- The equational theory of prebisimilarity over basic CCS with divergence (Q975471) (← links)
- The analysis of concurrent systems. Cambridge, September 12-16, 1983. Proceedings (Q1067764) (← links)
- Semantics of systems of concurrent processes. LITP Spring School on theoretical computer science, La Roche Posay, France, 23-27 April 1990. Proceedings (Q1188804) (← links)
- Mathematical foundations of programming semantics. 5th international conference, New Orleans, Louisiana, USA, March 29 -- April 1, 1989. Proceedings (Q1188840) (← links)
- Basic observables for processes (Q1286368) (← links)
- CONCUR '99. Concurrency theory. 10th international conference, Eindhoven, the Netherlands, August 24--27, 2999. Proceedings (Q1301512) (← links)
- Which data types have \(\omega\)-complete initial algebra specifications? (Q1318728) (← links)
- A decade of concurrency. Reflections and perspectives. REX School/ Symposium, Noordwijkerhout, the Netherlands, June 1-4, 1993. Proceedings (Q1328161) (← links)
- On the operational semantics of nondeterminism and divergence (Q1350504) (← links)
- Branching bisimilarity is an equivalence indeed! (Q1350620) (← links)
- A general conservative extension theorem in process algebras with inequalities (Q1391791) (← links)
- Object-oriented hybrid systems of coalgebras plus monoid actions (Q1575271) (← links)
- Measure and probability for concurrency theorists (Q1589655) (← links)
- Additive models of probabilistic processes (Q1607220) (← links)
- Rewriting logic: Roadmap and bibliography (Q1615001) (← links)
- Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours (Q1633345) (← links)
- On the metric-based approximate minimization of Markov chains (Q1785848) (← links)
- Testing preorders for probabilistic processes. (Q1854314) (← links)
- CONCUR `96: Concurrency theory. 7th international conference, Pisa, Italy, August 26--29, 1996. Proceedings (Q1920211) (← links)
- Axiomatizing recursion-free, regular monitors (Q2141297) (← links)
- The fixed-point theory of strictly causal functions (Q2257306) (← links)
- Compositionality of Hennessy-Milner logic by structural operational semantics (Q2368979) (← links)
- Keep it fair: equivalence and composition (Q2423741) (← links)
- Petri nets with name creation for transient secure association (Q2510386) (← links)
- A general SOS theory for the specification of probabilistic transition systems (Q2629851) (← links)
- Characteristic formulae for timed autoamta (Q2729632) (← links)
- Deriving Syntax and Axioms for Quantitative Regular Behaviours (Q3184671) (← links)
- (Q5111623) (← links)
- Process algebra for performance evaluation (Q5958464) (← links)
- Probabilistic weak bisimulation and axiomatization for probabilistic models (Q6161460) (← links)