CONCUR 2003 - Concurrency Theory

DOI10.1007/b11938zbMath1274.68255OpenAlexW105220891MaRDI QIDQ5900566

Rance Cleaveland, Scott A. Smolka, Eugene W. Stark

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

zbMATH Keywords

continuous-time Markov chainsstochastic process algebrasprocess equivalencestyping systems and algorithms

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (4)

Non-bisimulation-based Markovian behavioral equivalences ⋮ Generalized interface automata with multicast synchronization ⋮ Methodologies for Specification of Real-Time Systems Using Timed I/O Automata ⋮ A Calculus for Team Automata

This page was built for publication: CONCUR 2003 - Concurrency Theory