Observer-A Concept for Formal On-Line Validation of Distributed Systems
IEEE Transactions on Software Engineering
Compositional verification by model checking for counter-examples
ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
The meaning of negative premises in transition system specifications
Journal of the ACM (JACM)
Basic process algebra with deadlocking states
Theoretical Computer Science
Underspecification for a simple process algebra of recursive processes
Theoretical Computer Science
From rewrite rules to bisimulation congruences
Theoretical Computer Science
Specifying agent observable behaviour
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Simulation preorder over simple process algebras
Information and Computation
Formal methods for distributed processing
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
Theoretical Computer Science
Behavior Protocols for Software Components
IEEE Transactions on Software Engineering
A generic causal model for place latency
Theoretical Computer Science
Comparing refinements for failure and bisimulation semantics
Fundamenta Informaticae
Hereditary History Preserving Bisimilarity Is Undecidable
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
The State Explosion Problem from Trace to Bisimulation Equivalence
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Verifying Performance Equivalence for Timed Basic Parallel Processes
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
P-Hardness of Equivalence Testing on Finite-State Processes
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Encoding transition systems in sequent calculus
Theoretical Computer Science - Linear logic
Testing transition systems: an annotated bibliography
Modeling and verification of parallel processes
Undecidability of domino games and hhp-bisimilarity
Information and Computation
Localic sup-lattices and tropological systems
Theoretical Computer Science - Topology in computer science
Business processes for web services: principles and applications
IBM Systems Journal
On finite alphabets and infinite bases
Information and Computation
Relational Concurrent Refinement: Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Bisimulation and the reduction of Petri nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Probabilistic anonymity via coalgebraic simulations
ESOP'07 Proceedings of the 16th European conference on Programming
Testing transition systems with input and output testers
TestCom'03 Proceedings of the 15th IFIP international conference on Testing of communicating systems
Contexts, refinement and determinism
Science of Computer Programming
A finite basis for failure semantics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Color-Blind specifications for transformations of reactive synchronous programs
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
Incremental verification of component-based timed systems
International Journal of Computer Applications in Technology
Finite equational bases in process algebra: results and open questions
Processes, Terms and Cycles
Design rules and abstractions: from branching and real time
DCC'96 Proceedings of the 3rd international conference on Designing Correct Circuits
Comparing Refinements for Failure and Bisimulation Semantics
Fundamenta Informaticae
Full Abstractness of a Metric Semantics for Action Refinement
Fundamenta Informaticae
ON FOUR PARTIAL ORDERING SEMANTICS FOR A PROCESS CALCULUS
Fundamenta Informaticae
Is observational congruence axiomatisable in equational horn logic?
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
A comparison of succinctly represented finite-state systems
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
The difficulty of replacing an inclusive OR-join
BPM'12 Proceedings of the 10th international conference on Business Process Management
Isotactics as a foundation for alignment and abstraction of behavioral models
BPM'12 Proceedings of the 10th international conference on Business Process Management
Logical relations for fine-grained concurrency
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Behavioral consistency measurement and analysis of WS-BPEL processes
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
The right timing: reflections on the modeling and analysis of time
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Bisimilarity of Pushdown Automata is Nonelementary
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |