Timed transition systems with independence and timed event structures: an adjunction

MaRDI QIDQ2963874zbMATH OpenFDO

Authors R. S. Dubtsov

Publication date 21 February 2017

Full work available at URL http://bulletin.iis.nsk.su/files/article/dubtsov.pdf

zbMATH Keywords

concurrent executioninterleaving model of concurrencytransition

Mathematics Subject Classification ID

Continuous lattices and posets, applications (06B35) Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Categories of machines, automata (18B20) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Timed transition systems with independence and marked Scott domains: an adjunction
• A Domain View of Timed Behaviors
• A categorical view of timed behaviours
• Comparing transition systems with independence and asynchronous transition systems
• Open maps and behavioural equivalences for timed stable event structures

Cited in

(7)

• Event algebra for transition systems composition application to timed automata
• A categorical view of timed behaviours
• Behavioural equivalences for timed systems
• Timed transition systems with independence and marked Scott domains: an adjunction
• A functorial semantics for observed concurrency
• Comparing transition systems with independence and asynchronous transition systems
• Time separations of cyclic event rule systems with min-max timing constraints

This page was built for publication: Timed transition systems with independence and timed event structures: an adjunction

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