Electronic Notes in Theoretical Computer Science · 2006 · 31 citations · 4 references
ComputingComputer ScienceComputer SystemsFormal MethodsProgramming LanguagesSystems ProgrammingBoolean AlgebraData TypesDeductive VerificationPetri NetsProcess AlgebraType SystemsAbstract SemanticsAbstraction MechanismsCompositionality PrinciplesFormal SpecificationsPetri Net LanguagesPetri Net ModelsPetri Net SemanticsProof Language
We sketch the language mCRL2, the successor of μCRL, which is a process algebra with data, devised in 1990 to model and study the behaviour of interacting programs and systems. The language is improved in several respects guided by the experience obtained from numerous applications where realistic systems have been modelled and analysed. Just as with μCRL, the leading principle is to provide a minimal set of primitives that allow effective specifications, that conform to standard mathematics and that allow standard mathematical manipulations and proof methodologies. In the first place the equational abstract datatypes have been enhanced with higher-order constructs and standard data types, ranging from booleans, numbers and lists to sets, bags and higher-order function types. In the second place multi-actions have been introduced to allow a seamless integration with Petri nets. In the last place communication is made local to enable compositionality.
4
Lecture Notes in Artificial Intelligence
Patrick Brézillon, Paolo Bouquet · 1999 · 7.4K citations
Constructing Induction Rules for Deductive Synthesis Proofs
Alan Bundy, Lucas Dixon, Jeremy Gow et al. · Electronic Notes in Theoretical Computer Science · 2006 · 2.8K citations · Full text
The formal description technique LOTOS
Robert Milne · Science of Computer Programming · 1990 · 208 citations
A Process Specification Formalism1
Sjouke Mauw, G. J. Veltink · Fundamenta Informaticae · 1990 · 78 citations · Full text