Comparing transition systems with independence and asynchronous transition systems

DOI10.1007/3-540-61604-7_49zbMath1514.68169OpenAlexW1571721126MaRDI QIDQ6104367

Thomas Troels 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)

Related Items (3)

Factorisation of transition systems ⋮ Models for name-passing processes: Interleaving and causal ⋮ Model-checking games for fixpoint logics with partial order models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Concurrent Machines
• Process Algebra
• PETRI NETS AND STEP TRANSITION SYSTEMS

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