scientific article; zbMATH DE number 2040321

MaRDI QIDQ4449536zbMATH OpenFDO

Authors Peter Buchholz, Peter Kemper

Publication date 11 February 2004

Mathematics Subject Classification ID

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

Recommendations

• Computing maximal weak and other bisimulations
• Weak MSO: automata and expressiveness modulo bisimilarity
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Weak bisimulations for fuzzy automata
• scientific article; zbMATH DE number 1231553
• Weak Bisimulation Approximants
• scientific article; zbMATH DE number 1418352
• Extensions of standard weak bisimulation machinery: finite-state general processes, refinable actions, maximal-progress and time
• Bisimulation relations for weighted automata
• Weak bisimulation as a congruence in MSOS

Cited in

(12)

• Compositions of (max,+) automata
• Bisimulations for weighted automata over an additively idempotent semiring
• Bisimulation relations for weighted automata
• Weak bisimulations for fuzzy automata
• Coinduction in concurrent timed systems
• Placement Inference for a Client-Server Calculus
• scientific article; zbMATH DE number 1163641 (Why is no real title available?)
• scientific article; zbMATH DE number 2040327 (Why is no real title available?)
• Model checking for a class of weighted automata
• Simulations and bisimulations for max-plus automata
• A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces
• Component simulation-based substitutivity managing QoS and composition issues

This page was built for publication:

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