A formal semantics for concurrent systems with a priority relation
Acta Informatica
Bounded nondeterminism and the approximation induction principle in process algebra
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
Every logic program has a natural stratification and an iterated least fixed point model
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An operational semantics for occam
International Journal of Parallel Programming
Process algebra
The linear time-branching time spectrum (extended abstract)
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Query evaluation under the well-founded semantics
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Structured operational semantics and bisimulation as a congruence
Information and Computation
Transition system specifications with negative premises
Theoretical Computer Science
Turning SOS rules into equations
Information and Computation
Journal of the ACM (JACM)
Structural operational semantics for weak bisimulations
Theoretical Computer Science
Proving congruence of bisimulation in functional programming languages
Information and Computation
Ntyft/ntyxt rules reduce to ntree rules
Information and Computation
A general conservative extension theorem in process algebras with inequalities
ACP '95 Proceedings from the international workshop on Algebra of communicating processes
Unfounded sets and well-founded semantics for general logic programs
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Calculus of Communicating Systems
A Calculus of Communicating Systems
A congruence theorem for structured operational semantics with predicates and negative premises
Nordic Journal of Computing
A Testing Theory for LOTOS using Deadlock Detection
Proceedings of the IFIP WG6.1 Ninth International Symposium on Protocol Specification, Testing and Verification IX
Incremental specification in LOTOS
Proceedings of the IFIP WG6.1 Tenth International Symposium on Protocol Specification, Testing and Verification X
From timed Petri nets to timed LOTOS
Proceedings of the IFIP WG6.1 Tenth International Symposium on Protocol Specification, Testing and Verification X
Linear and Branching Structures in the Semantics and Logics of Reactive Systems
Proceedings of the 12th Colloquium on Automata, Languages and Programming
CPO Models for a Class of GSOS Languages
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th 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
Deriving Complete Inference Systems for a Class of GSOS Languages Generation Regular Behaviours
CONCUR '94 Proceedings of the 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
The Meaning of Negative Premises in Transition System Specifications II
The Meaning of Negative Premises in Transition System Specifications II
Precongruence Formats for Decorated Trace Preorders
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Precongruence formats for decorated trace semantics
ACM Transactions on Computational Logic (TOCL)
A format for semantic equivalence comparison
Theoretical Computer Science
Branching time and orthogonal bisimulation equivalence
Theoretical Computer Science
SOS for higher order processes
CONCUR 2005 - Concurrency Theory
The compression structure of a process
Information Processing Letters
Compositionality of Hennessy-Milner logic by structural operational semantics
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Inferring dynamic credentials for rôle-based trust management
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
A Congruence Rule Format with Universal Quantification
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
A Rule Format for Associativity
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Semantics and expressiveness of ordered SOS
Information and Computation
Structural Operational Semantics with First-Order Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
A Hierarchy of SOS Rule Formats
Electronic Notes in Theoretical Computer Science (ENTCS)
Prototyping SOS Meta-theory in Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
The compression structure of a process
Information Processing Letters
A syntactic commutativity format for SOS
Information Processing Letters
Non-expansive ε-bisimulations for probabilistic processes
Theoretical Computer Science
Branching vs. linear time: semantical perspective
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Transforming SOS specifications to linear processes
FMICS'11 Proceedings of the 16th international conference on Formal methods for industrial critical systems
Divide and congruence: from decomposition of modalities to preservation of branching bisimulation
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Orthogonal extensions in structural operational semantics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Congruence for structural congruences
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
Information and Computation
Probabilistic transition system specification: congruence and full abstraction of bisimulation
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Formalizing a domain specific language using SOS: an industrial case study
SLE'11 Proceedings of the 4th international conference on Software Language Engineering
Modular semantics for transition system specifications with negative premises
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Hi-index | 0.01 |
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in order to be meaningful, that is, to unequivocally define a transition relation. We also provide powerful techniques for proving that a TSS satisfies this criterion, meanwhile constructing this transition relation. Both the criterion and the techniques originate from logic programming [van Gelder et al. 1988; Gelfond and Lifschitz 1988] to which TSSs are close. In an appendix we provide an extensive comparison between them.As in Groote [1993], we show that the bisimulation relation induced by a TSS is a congruence, provided that it is in ntyft/ntyxt-format and can be proved meaningful using our techniques. We also considerably extend the conservativity theorems of Groote[1993] and Groote and Vaandrager [1992]. As a running example, we study the combined addition of priorities and abstraction to Basic Process Algebra (BPA). Under some reasonable conditions we show that this TSS is indeed meaningful, which could not be shown by other methods [Bloom et al. 1995; Groote 1993]. Finally, we provide a sound and complete axiomatization for this example.