Extended transition systems for parametric bisimulation

DOI10.1007/3-540-56939-1_102zbMath1422.68169OpenAlexW1595384811MaRDI QIDQ4630292

Daniel Yankelevich, Paula Inverardi, Corrado Priami

Publication date: 29 March 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56939-1_102

zbMATH Keywords

regular languagetransition systemregular expressionoperational semanticparametric theory

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Universal axioms for bisimulations
• Concurrent histories: a basis for observing distributed systems
• A theory of processes with localities
• Automatizing parametric reasoning on distributed concurrent systems
• A Unified Approach to Path Problems
• Fast Algorithms for Solving Path Problems
• A parametric approach to localities
• Proved trees

This page was built for publication: Extended transition systems for parametric bisimulation