Graphical versus logical specifications
CAAP '90 Proceedings of the fifteenth colloquium on CAAP'90
Undecidable equivalences for basic process algebra
Information and Computation
A behavioral notion of subtyping
ACM Transactions on Programming Languages and Systems (TOPLAS)
Generality in design and compositional verification using Tav
Formal Methods in System Design
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
An industrial application of modal process logic
Science of Computer Programming - Special issue on COST 247, verification and validation methods for formal descriptions
Information and Computation - Special issue on EXPRESS 1997
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
A Logic for the Java Modeling Language JML
FASE '01 Proceedings of the 4th International Conference on Fundamental Approaches to Software Engineering
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
On the Complexity of Semantic Equivalences for Pushdown Automata and BPA
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Undecidable Equivalences for Basic Parallel Processes
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Simulation Preorder on Simple Process Algebras
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Generalized Model Checking: Reasoning about Partial State Spaces
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Abstraction-Based Model Checking Using Modal Transition Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Why Is Simulation Harder than Bisimulation?
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Checking Regular Properties of Petri Nets
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Timed Modal Specification - Theory and Tools
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The Existence of Finite Abstractions for Branching Time Model Checking
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Merging partial behavioural models
Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering
MTSA: Eclipse support for modal transition systems construction, analysis and elaboration
Proceedings of the 2007 OOPSLA workshop on eclipse technology eXchange
On determinism in modal transition systems
Theoretical Computer Science
Why Are Modalities Good for Interface Theories?
ACSD '09 Proceedings of the 2009 Ninth International Conference on Application of Concurrency to System Design
Don't Know for Multi-valued Systems
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Compositional may-must program analysis: unleashing the power of alternation
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modal I/O automata for interface and product line theories
ESOP'07 Proceedings of the 16th European conference on Programming
Compositional Design Methodology with Constraint Markov Chains
QEST '10 Proceedings of the 2010 Seventh International Conference on the Quantitative Evaluation of Systems
ECDAR: an environment for compositional design and analysis of real time systems
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Quantitative refinement for weighted modal transition systems
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Modal transition systems: composition and LTL model checking
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Parametric modal transition systems
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
MIO workbench: a tool for compositional design with modal input/output interfaces
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Visibly pushdown automata: from language equivalence to simulation and bisimulation
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Reachability of hennessy-milner properties for weakly extended PRS
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Dual-Priced modal transition systems with time durations
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Modal event-clock specifications for timed component-based design
Science of Computer Programming
A Modal Interface Theory for Component-based Design
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
Hi-index | 0.00 |
We consider modal transition systems with infinite state space generated by finite sets of rules. In particular, we extend process rewrite systems to the modal setting and investigate decidability of the modal refinement relation between systems from various subclasses. Since already simulation is undecidable for most of the cases, we focus on the case where either the refined or the refining process is finite. Namely, we show decidability for pushdown automata extending the non-modal case and surprising undecidability for basic parallel processes. Further, we prove decidability when both systems are visibly pushdown automata. For the decidable cases, we also provide complexities. Finally, we discuss a notion of bisimulation over MTS.