A note on the construction of marked graphs

DOI10.1016/0020-0190(95)00076-OzbMATH Open0998.68535OpenAlexW2028974560MaRDI QIDQ1350366FDOQ1350366

K. Thirusangu, K. Rangarajan

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00076-o

zbMATH Keywords

AlgorithmsAcceptorsDependency relationMarked graphsTrace languages

Mathematics Subject Classification ID

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

Cites Work

• Learning regular sets from queries and counterexamples
• Title not available (Why is that?)
• Theory of traces
• Synthesis of Decision-Free Concurrent Systems for Prescribed Resources and Performance

This page was built for publication: A note on the construction of marked graphs

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