scientific article; zbMATH DE number 1735632

MaRDI QIDQ4329016zbMATH OpenFDO

Authors Joaquín Aguado, Tudor Bălănescu, Tony Cowling, Marian Gheorghe, Mike Holcombe, Florentin Ipate

Publication date 14 November 2002

zbMATH Keywords

Eilenberg machinesP systemsreplicated rewritingX-machines

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Combined power of X-machines and P systems
• Modelling P systems by communicating X-machine systems
• An efficient way to model P systems by X-machine systems
• PX systems = P systems + X machines
• Testing non-deterministic stream X-machine models and P systems

Cited in

(11)

• Formal verification of cP systems using PAT3 and ProB
• Fundamental results for learning deterministic extended finite state machines from queries
• Testing against a non-controllable stream X-machine using state counting
• A unified integration and component testing approach from deterministic stream X-machine specifications
• Modelling P systems by communicating X-machine systems
• On the Minimality of Stream X-machines
• Combined power of X-machines and P systems
• An efficient way to model P systems by X-machine systems
• scientific article; zbMATH DE number 6665225 (Why is no real title available?)
• Testing data processing-oriented systems from stream X-machine models
• Checking experiments for stream X-machines

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4329016)