Comparing transition systems with independence and asynchronous transition systems

DOI10.1007/3-540-61604-7_49MaRDI QIDQ6104367zbMATH OpenOpenAlexFDO

Authors Thomas Hildebrandt, Vladimiro Sassone

Publication date 28 June 2023

Published in CONCUR '96: Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://eprints.soton.ac.uk/261955/1/tsi-ats.pdf

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categories of machines, automata (18B20)

Recommendations

• scientific article; zbMATH DE number 1059332
• Timed transition systems with independence and timed event structures: an adjunction
• Timed transition systems with independence and marked Scott domains: an adjunction
• Transition systems, event structures, and unfoldings
• Independence abstractions and models of concurrency

Cites work

• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• scientific article; zbMATH DE number 177237 (Why is no real title available?)
• Concurrent Machines
• PETRI NETS AND STEP TRANSITION SYSTEMS
• Process Algebra

Cited in

(4)

• Models for name-passing processes: Interleaving and causal
• Factorisation of transition systems
• Model-checking games for fixpoint logics with partial order models
• Timed transition systems with independence and timed event structures: an adjunction

This page was built for publication: Comparing transition systems with independence and asynchronous transition systems

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