Computing Stuttering Simulations

DOI10.1007/978-3-642-04081-8_36zbMath1254.68179arXiv0904.1488OpenAlexW2169119285MaRDI QIDQ3184698

Francesco Tapparo, Francesco Ranzato

Publication date: 22 October 2009

Published in: CONCUR 2009 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0904.1488

Mathematics Subject Classification ID

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

Related Items

Cooking Your Own Parity Game Preorders Through Matching Plays, Investigating single-type structural elements of a component Petri net during component modeling and analysis of a complex system with parallelism, Game-theoretic simulation checking tool

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalizing the Paige-Tarjan algorithm by abstract interpretation
• Characterizing finite Kripke structures in propositional temporal logic
• Three logics for branching bisimulation
• Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata