Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Bounded nondeterminism and the approximation induction principle in process algebra
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Process algebra
The meaning of negative premises in transition system specifications (extended abstract)
Proceedings of the 18th international colloquium on Automata, languages and programming
Process algebra with a zero object
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Transition system specifications with negative premises (extended abstract)
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
A temporal calculus of communicating systems
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Handbook of theoretical computer science (vol. B)
Termination, deadlock, and divergence
Journal of the ACM (JACM)
Structured operational semantics and bisimulation as a congruence
Information and Computation
The Tyft/Tyxt Format Reduces to Tree Rules
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Completeness in Real Time Process Algebra
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Compositional Verification of Probabilistic Processes
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
A Congruence Theorem for Structured Operational Semantics with Predicates
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
A General Conservative Extension Theorem in Process Algebra
PROCOMET '94 Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi
Timed Process Algebras with Urgent Interactions and a Unique Powerful Binary Operator
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Process Algebra with Backtracking
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
The meaning of negative premises in transition system specifications
Journal of the ACM (JACM)
Proceedings of the 3rd ACM international workshop on Data warehousing and OLAP
Ninth International Conference on Information and Knowledge Management
Ordered SOS process languages for branching and Eager bisimulation
Information and Computation
A comparison of Statecharts step semantics
Theoretical Computer Science
Refusal Simulation and Interactive Games
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Axiomatizing GSOS with Termination
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Statecharts Via Process Algebra
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Process Languages for Rooted Eager Bisimulation
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Precongruence formats for decorated trace semantics
ACM Transactions on Computational Logic (TOCL)
A format for semantic equivalence comparison
Theoretical Computer Science
Bisimulation on speed: worst-case efficiency
Information and Computation
Located actions in process algebra with timing
Fundamenta Informaticae
Notions of bisimulation and congruence formats for SOS with data
Information and Computation
SOS for higher order processes
CONCUR 2005 - Concurrency Theory
Bisimulation on speed: a unified approach
Theoretical Computer Science
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
Priority and abstraction in process algebra
Information and Computation
A Congruence Rule Format with Universal Quantification
Electronic Notes in Theoretical Computer Science (ENTCS)
A Rule Format for Associativity
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Process Algebra: An Algebraic Theory of Concurrency
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
A Rule Format for Unit Elements
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
A Hierarchy of SOS Rule Formats
Electronic Notes in Theoretical Computer Science (ENTCS)
A Congruence Format for Name-passing Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Notions of bisimulation and congruence formats for SOS with data
Information and Computation
A syntactic commutativity format for SOS
Information Processing Letters
Orthogonal extensions in structural operational semantics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Rule formats for determinism and idempotence
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Congruence for structural congruences
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Probabilistic congruence for semistochastic generative processes
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Timing the untimed: terminating successfully while being conservative
Processes, Terms and Cycles
Rule formats for determinism and idempotence
Science of Computer Programming
Located Actions in Process Algebra with Timing
Fundamenta Informaticae
Modular semantics for transition system specifications with negative premises
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
We proposed a syntactic format, the panth format, for structured operational semantics in which besides ordinary transitions also predicates, negated predicates, and negative transitions may occur such that if the rules are stratifiable, strong bisimulation equivalence is a congruence for all the operators that can be defined within the panth format. To show that this format is useful we took some examples from the literature satisfying the panth format but no formats proposed by others. The examples touch upon issues such as priorities, termination, convergence, discrete time, recursion, (infinitary) Hennessy-Milner logic, and universal quantification.