On constructibility and unconstructibility of LTS operators from other LTS operators

DOI10.1007/s00236-015-0217-2zbMath1328.68140OpenAlexW2058694001MaRDI QIDQ2340256

Antti Valmari

Publication date: 16 April 2015

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-015-0217-2

zbMATH Keywords

labelled transition systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

All congruences below stability-preserving fair testing or CFFD

Uses Software

• LOTOS

Cites Work

• On cool congruence formats for weak bisimulations
• Structural operational semantics for weak bisimulations
• The weakest deadlock-preserving congruence
• Algèbre de processus et synchronisation
• Fair testing
• Higher-level synchronising devices in Meije-SCCS
• Compositional failure-based semantic models for basic LOTOS
• Towards a unified approach to encodability and separation results for process calculi
• Understanding concurrent systems
• All Linear-Time Congruences for Familiar Operators
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On constructibility and unconstructibility of LTS operators from other LTS operators