Simulation Revisited

No abstract is available for this paper.

• Publication year

  2001

• Venue

  International Conference on Tools and Algorithms for Construction and Analysis of Systems

• Publication date

  2001-04-02

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/3-540-45319-9_33
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Abstract interpretation of reactive systems

  1997cited by this paper
• Modeling and Verifying Distributed Systems Using Priorities: A Case Study

  1996cited by this paper
• Semantic preorders in the automated verification of concurrent systems

  1996cited by this paper
• Computing simulations on finite and infinite graphs

  1995cited by this paper
• Forward and Backward Simulations: I. Untimed Systems

  1995cited by this paper
• Transformational Design and Implementation of a New Efficient Solution to the Ready Simulation Problem

  1995cited by this paper
• Minimal State Graph Generation

  1992cited by this paper
• Property Preserving Simulations

  1992cited by this paper
• Simulations Between Specifications of Distributed Systems

  1991cited by this paper
• When is 'partial' adequate? A logic-based proof technique using partial specifications

  1990cited by this paper
• An Implementation of an Efficient Algorithm for Bisimulation Equivalence

  1990cited by this paper
• Design and analysis of algorithms

  1989cited by this paper
• Ready simulation, bisimulation, and the semantics of CCS-like languages

  1989cited by this paper
• Three Partition Refinement Algorithms

  1987cited by this paper
• Testing Equivalences for Processes

  1984cited by this paper
• A Theory of Communicating Sequential Processes

  1984cited by this paper
• The Design and Analysis of Computer Algorithms

  1974cited by this paper
• Functional and Behavioral Application

  1972cited by this paper
• An Algebraic Definition of Simulation Between Programs

  1971cited by this paper
• The Behavior of Stock-Market Prices

  1965cited by this paper

• The Reachable Simulation Problem

  2025cites this paper
• Computing Reachable Simulations

  2022cites this paper
• Online Simulation Reduction

  2022cites this paper
• Incapacity and Simulation: Mutually Exclusive Grounds or Key Juridic Facts Underlying Conforming Sentences?

  2016cites this paper
• A space-efficient simulation algorithm on probabilistic automata

  2016influential citation
• Rank and simulation: the well-founded case

  2015cites this paper
• NFA reduction for regular expressions matching using FPGA

  2013cites this paper
• Automatic behavior composition synthesis

  2013influential citation
• An efficient simulation algorithm on Kripke structures

  2012cites this paper
• Social positions and simulation relations

  2012cites this paper
• Rank-Based Simulation on Acyclic Graphs

  2012cites this paper
• Extending graph homomorphism and simulation for real life graph matching

  2011cites this paper
• An Algorithm for Probabilistic Alternating Simulation

  2011cites this paper
• Static Analysis, Abstract Interpretation and Verification in (Constraint Logic) Programming

  2010cites this paper
• Saving Space in a Time Efficient Simulation Algorithm

  2009cites this paper
• Decision algorithms for probabilistic simulations

  2009influential citation
• Improved verification methods for concurrent systems

  2009cites this paper
• Behavior Composition in the Presence of Failure

  2008cites this paper
• Automatic Service Composition via Simulation

  2008cites this paper
• A Space-Efficient Probabilistic Simulation Algorithm

  2008cites this paper
• Principles of model checking

  2008cites this paper
• Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology 562 Reduction Techniques for Finite ( Tree ) Automata

  2008influential citation
• Correcting a Space-Efficient Simulation Algorithm

  2008cites this paper
• ×ô Blockinø¹¹ööúò Èöóôöøý Îöö¬ Blockin Blockinøøóò Óó Áò Blockinóò×××øøòø Ëý×øøñ × Blockinööôøøóò×

  2007cites this paper
• An efficient simulation algorithm based on abstract interpretation

  2007influential citation
• An efficient simulation equivalence algorithm based on abstract interpretation

  2007cites this paper
• A New Efficient Simulation Equivalence Algorithm

  2007influential citation
• Generalizing the Paige-Tarjan algorithm by abstract interpretation

  2006cites this paper
• Simulation for Interactive Markov Chains

  2006cites this paper
• Compositional verification of hybrid systems using simulation relations

  2005cites this paper
• Probabilistic weak simulation is decidable in polynomial time

  2004cites this paper
• Modeling component connectors in Reo by constraint automata

  2004cites this paper
• Generalized Strong Preservation by Abstract Interpretation

  2004cites this paper
• A Behavioral Model of Component Frameworks

  2003cites this paper
• From Bisimulation to Simulation: Coarsest Partition Problems

  2003cites this paper
• An Abstract Schema for Equivalence-Checking Games

  2002cites this paper
• Evidence-based verification

  2002influential citation
• Simulation as Coarsest Partition Problem

  2002cites this paper