Comparing transition systems with independence and asynchronous transition systems

DOI10.1007/3-540-61604-7_49zbMATH Open1514.68169OpenAlexW1571721126MaRDI QIDQ6104367FDOQ6104367

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

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

Mathematics Subject Classification ID

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

Cites Work

• Concurrent Machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• Process Algebra
• Title not available (Why is that?)
• PETRI NETS AND STEP TRANSITION SYSTEMS
• Title not available (Why is that?)

Cited In (4)

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

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)