Trace-oriented models of concurrency

MaRDI QIDQ2760239zbMATH OpenFDO

Authors Manfred Broy, Ernst-Rüdiger Olderog

Publication date 18 December 2001

zbMATH Keywords

transition behaviour of automata

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 3938548
• scientific article; zbMATH DE number 1927580
• Connections between a concrete and an abstract model of concurrent systems
• Theory of traces
• Nets, Terms and Formulas

Cited in

(10)

• Processes with local and global liveness requirements
• A fully abstract trace model for dataflow and asynchronous networks
• Processes with infinite liveness requirements
• scientific article; zbMATH DE number 1931943 (Why is no real title available?)
• On the synchronization of traces
• Modeling concurrency with interval traces
• On Compiling Structured Interactive Programs with Registers and Voices
• Communicating Sequential Processes. The First 25 Years
• Modelling concurrency with comtraces and generalized comtraces
• Cameo: an alternative model of concurrency for Eiffel

This page was built for publication: Trace-oriented models of concurrency

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2760239)