CONCUR 2003 - Concurrency Theory
From MaRDI portal
Publication:5900567
DOI10.1007/b11938zbMath1274.68161OpenAlexW105220891MaRDI QIDQ5900567
Roberto Segala, Frits W. Vaandrager, Nancy A. Lynch
Publication date: 30 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11938
Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (7)
Switched PIOA: parallel composition via distributed scheduling ⋮ A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ A reconstruction of Ewens' sampling formula via lists of coins ⋮ Mixed nondeterministic-probabilistic automata: blending graphical probabilistic models with nondeterminism ⋮ The compositional construction of Markov processes ⋮ Towards general axiomatizations for bisimilarity and trace semantics ⋮ Task-structured probabilistic I/O automata
This page was built for publication: CONCUR 2003 - Concurrency Theory
